RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2007 Volume 43, Issue 2, Pages 52–64 (Mi ppi11)

This article is cited 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$.

UDC: 621.391.15

Received: 15.09.2006
Revised: 16.01.2007


 English version:
Problems of Information Transmission, 2007, 43:2, 113–123

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026