|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 1, Pages 58–69
(Mi ppi320)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Bounds on Distances for Unit Memory Concatenated Codes
V. V. Zyablov, J. Justesen, C. Thommesen, S. A. Shavgulidze
Abstract:
Two schemes of concatenated coding on the basis of outer unit memory code are considered. Constructive lower bounds for free distance, also for extended row, column, and segment distances are obtained. It is proved that in the random ensemble of unit memory concatenated codes there exist codes that asymptotically meet the best known bounds on distances for unit memory codes.
Citation:
V. V. Zyablov, J. Justesen, C. Thommesen, S. A. Shavgulidze, “Bounds on Distances for Unit Memory Concatenated Codes”, Probl. Peredachi Inf., 32:1 (1996), 58–69; Problems Inform. Transmission, 31:1 (1996), 48–57
Linking options:
https://www.mathnet.ru/eng/ppi320 https://www.mathnet.ru/eng/ppi/v32/i1/p58
|
Statistics & downloads: |
Abstract page: | 299 | Full-text PDF : | 115 | First page: | 2 |
|