|
Problemy Peredachi Informatsii, 1975, Volume 11, Issue 1, Pages 57–63
(Mi ppi1571)
|
|
|
|
Coding Theory
Nonbinary Arithmetic Codes with Large Minimum Distance
I. M. Boyarinov
Abstract:
$AN$ codes over an arbitrary base $r$ are discussed. A unique canonical $r$-ary representation having a minimum number of nonzero terms is found for the number $N$. An expression is obtained for the minimum distance of $r$-ary $AN$ codes with large distance for two metrics: arithmetic and Hamming.
Received: 03.01.1974
Citation:
I. M. Boyarinov, “Nonbinary Arithmetic Codes with Large Minimum Distance”, Probl. Peredachi Inf., 11:1 (1975), 57–63; Problems Inform. Transmission, 1:11 (1975), 44–49
Linking options:
https://www.mathnet.ru/eng/ppi1571 https://www.mathnet.ru/eng/ppi/v11/i1/p57
|
Statistics & downloads: |
Abstract page: | 238 | Full-text PDF : | 120 |
|