215 search results - page 7 / 43 » The asymptotic number of binary codes and binary matroids |
DM
2000
14 years 9 months ago
2000
Let exq(G; n) be the maximum number of points in a rank-n geometry (simple matroid) that is representable over GF(q) and that has no restriction isomorphic to the geometry G. We fi...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time...
88
Voted
EUROCRYPT
2012
Springer
12 years 12 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...
78
Voted
JCT
2002
14 years 9 months ago
2002
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...