Information Theory and Coding Theory

Asymptotically Optimal Codes Correcting Memory Defects of Fixed Multiplicity

I. I. Dumer


Abstract: An asymptotically optimal class of codes of length $n\to\infty$ is proposed for correction of $t=\mathrm{const}$ defects. The length-$n$ code can be constructed in time $O(\log_2n)$, and its coding and decoding requires order of $n$ operations.

UDC: 621.391.15

Received: 06.01.1988

 English version: Problems of Information Transmission, 1989, 25:4, 259–265

Bibliographic databases:

• 
•