3373 search results - page 77 / 675 » Linear transformations on codes |
AAECC
1997
Springer
15 years 2 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...
DCC
2002
IEEE
14 years 9 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...