liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Bounds and constructions for ternary constant-composition codes
Linköping University, The Institute of Technology. Linköping University, Department of Electrical Engineering.
Östergård, P.R.J., IEEE, Department of Computer Science and Engineering, Helsinki University of Technology, 02015 Hut, Finland.
Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 5000 V. Tarnovo, Bulgaria.
2002 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 48, no 1, 101-111 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Constant-weight codes, Nonbinary codes, Weight constraints
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-47130DOI: 10.1109/18.971741OAI: diva2:268026
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-01-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Svanström, Mattias
By organisation
The Institute of TechnologyDepartment of Electrical Engineering
In the same journal
IEEE Transactions on Information Theory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link