386 search results - page 27 / 78 » The Weights in MDS Codes |
114
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
106
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
COMBINATORICS
2006
14 years 12 months ago
2006
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure...
AAECC
1997
Springer
15 years 4 months ago
1997
Springer
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...