386 search results - page 15 / 78 » The Weights in MDS Codes |
COMBINATORICS
2002
14 years 11 months ago
2002
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
DCC
1999
IEEE
14 years 11 months ago
1999
IEEE
We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
108
click to vote
SAC
2000
ACM
15 years 4 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
TIT
2008
14 years 11 months ago
2008
Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average technique has been exploited to derive tight performance b...
106
click to vote
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...