1579 search results - page 35 / 316 » On the Constructions of Constant-Weight Codes |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
83
Voted
COMBINATORICS
1998
14 years 9 months ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
86
Voted
TWC
2008
14 years 9 months ago
2008
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
70
Voted
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. Code "clones" are similar segments of code that are frequently introduced by "scavenging" existing code, that is, reusing code by copying it and adapt...