Name
Abstract | ||
|---|---|---|
We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance) |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/18.623161 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
normalized minimal distance,linear binary code,long packing,unrestricted binary code,mathematics,binary codes,upper bound,information theory | Hamming code,Discrete mathematics,Combinatorics,Concatenated error correction code,Low-density parity-check code,Block code,Expander code,Gray code,Reed–Solomon error correction,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
43 | 5 | 0018-9448 |
Citations | PageRank | References |
4 | 0.66 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gérard Cohen | 1 | 877 | 176.34 |
| Iiro S. Honkala | 2 | 11 | 1.60 |
| S. Litsyn | 3 | 602 | 50.31 |
| Patrick Solé | 4 | 48 | 12.83 |