Bounds and constructions for ternary constant-composition codes
2002 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 48, no 1, 101-111 p.Article in journal (Refereed) Published
The problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in each codeword. Upper and lower bounds on the size of such codes under Hamming metric are discussed, where the lower bounds follow from constructions of good codes. Some of the results are obtained by explicitly finding codes by computer search. A table of exact values and best known bounds on the maximum size for codes of length at most 10 is presented.
Place, publisher, year, edition, pages
2002. Vol. 48, no 1, 101-111 p.
Constant-weight codes, Nonbinary codes, Weight constraints
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-47130DOI: 10.1109/18.971741OAI: oai:DiVA.org:liu-47130DiVA: diva2:268026