|
Problemy Peredachi Informatsii, 2007, Volume 43, Issue 2, Pages 52–64
(Mi ppi11)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Uniqueness of Some Optimal Superimposed Codes
S. Honga, Kim Hyun Kwanga, S. N. Kapralovb, Oh Dong Yeolc a Pohang University of Science and Technology
b Technical University of Gabrovo
c Korea Advanced Institute of Science and Technology
Abstract:
Four new results on the uniqueness of optimal superimposed codes are presented,
namely, the uniqueness of $(w,r)$ superimposed codes of size $N\times T$ with
$\displaystyle N=\binom{w+r+1}w$ and $T=w+r+1$ and the uniqueness of $(2,2)$ superimposed codes of size $18\times9$, $(2,2)$ superimposed codes of size $14\times7$, and $(3,3)$ superimposed codes of size
$66\times11$.
Received: 15.09.2006 Revised: 16.01.2007
Citation:
S. Hong, Kim Hyun Kwang, S. N. Kapralov, Oh Dong Yeol, “Uniqueness of Some Optimal Superimposed Codes”, Probl. Peredachi Inf., 43:2 (2007), 52–64; Problems Inform. Transmission, 43:2 (2007), 113–123
Linking options:
https://www.mathnet.ru/eng/ppi11 https://www.mathnet.ru/eng/ppi/v43/i2/p52
|
Statistics & downloads: |
Abstract page: | 411 | Full-text PDF : | 83 | References: | 47 | First page: | 4 |
|