|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 2, Pages 39–44
(Mi ppi335)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Optimal Sets of Binary Sequences
B. Zh. Kamaletdinov
Abstract:
We suggest an efficient method for designing families of binary sequences that are optimal in the sense of packing bounds. We show that the new classes of ensembles compare favorably to the known ones in a greater variety of methods for forming the fine structure of a code and a very representable collection of existence lengths.
Received: 20.03.1995
Citation:
B. Zh. Kamaletdinov, “Optimal Sets of Binary Sequences”, Probl. Peredachi Inf., 32:2 (1996), 39–44; Problems Inform. Transmission, 32:2 (1996), 171–175
Linking options:
https://www.mathnet.ru/eng/ppi335 https://www.mathnet.ru/eng/ppi/v32/i2/p39
|
Statistics & downloads: |
Abstract page: | 580 | Full-text PDF : | 305 |
|