Name
Abstract | ||
|---|---|---|
A recursive construction of asymptotically dense codes correcting a constant number of localized errors is examined. The codes overcome difficulties for a particular case with an asymptotic Hamming bound in which the number of errors increases linearly with the length of codes. It is shown that this method is applicable to both binary and nonbinary cases |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/18.243459 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Hamming codes,error correction codes,asymptotic Hamming bound,asymptotically dense codes,localised errors correction,nonbinary codes,recursive construction | Hamming code,Discrete mathematics,Block code,Algorithm,Error detection and correction,Coding (social sciences),Linear code,Hamming bound,Recursion,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
39 | 4 | 0018-9448 |
Citations | PageRank | References |
7 | 1.08 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rudolf Ahlswede | 1 | 3136 | 657.12 |
| Leonid A. Bassalygo | 2 | 31 | 10.12 |
| Mark S. Pinsker | 3 | 35 | 13.59 |