The PBD-Closure of Constant-Composition Codes
From MaRDI portal
Publication:3549113
DOI10.1109/TIT.2007.901175zbMath1181.94124arXiv0712.2552OpenAlexW3098152193MaRDI QIDQ3549113
No author found.
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.2552
pairwise balanced design (PBD)-closure resultset of lengths of constant-composition codessize of optimal constant-composition codes
Related Items (7)
Unnamed Item ⋮ Room squares with super-simple property ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ A construction of group divisible designs with block sizes 3 to 7 ⋮ Generalized balanced tournament designs and related codes ⋮ A class of optimal constant composition codes from GDRPs
This page was built for publication: The PBD-Closure of Constant-Composition Codes