WFRF:(Bogdanova G.)
Search: WFRF:(Bogdanova G.) > (2002-2004) > Bounds and construc...
- 1 of 1
- Previous record
- Next record
- To hitlist
Bounds and constructions for ternary constant-composition codes
-
- Svanström, Mattias (author)
- Linköpings universitet,Tekniska högskolan,Institutionen för systemteknik
-
- Ostergard, P.R.J. (author)
- Östergård, P.R.J., IEEE, Department of Computer Science and Engineering, Helsinki University of Technology, 02015 Hut, Finland
-
- Bogdanova, G.T. (author)
- Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 5000 V. Tarnovo, Bulgaria
- (creator_code:org_t)
- Institute of Electrical and Electronics Engineers (IEEE), 2002
- 2002
- English.
- In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 48:1, s. 101-111
- Journal article (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Keyword
- Constant-weight codes
- Nonbinary codes
- Weight constraints
- TECHNOLOGY
- TEKNIKVETENSKAP
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
- IEEE Transactions on Information Theory (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Svanström, Matti ...
- Ostergard, P.R.J ...
- Bogdanova, G.T.
- Articles in the publication
- IEEE Transaction ...
- By the university
- Linköping University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
