Sciweavers

95 search results - page 2 / 19
» Extendability of Ternary Linear Codes
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
Rate-Compatible Serially Concatenated Codes with Outer Extended BCH Codes
— In this paper, we propose a rate-compatible serially concatenated structure consisting of an outer linear extended BCH code and an inner recursive systematic convolutional code...
Alexandre Graell i Amat, Raphaël Le Bidan
TIT
2011
144views more  TIT 2011»
13 years 12 days ago
Network Generalized Hamming Weight
— In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight ...
Chi Kin Ngai, Raymond W. Yeung, Zhen Zhang
SIAMDM
2008
72views more  SIAMDM 2008»
13 years 5 months ago
Prolific Codes with the Identifiable Parent Property
Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y C if di {xi, yi} for 1 i n. A code C is an identifiable parent prop...
Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 5 months ago
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
Zheng Wang, Jie Luo
FOCS
2007
IEEE
13 years 11 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav