Sökning: onr:"swepub:oai:DiVA.org:liu-47130" >
Bounds and construc...
Bounds and constructions for ternary constant-composition codes
-
- Svanström, Mattias (författare)
- Linköpings universitet,Tekniska högskolan,Institutionen för systemteknik
-
- Ostergard, P.R.J. (författare)
- Östergård, P.R.J., IEEE, Department of Computer Science and Engineering, Helsinki University of Technology, 02015 Hut, Finland
-
- Bogdanova, G.T. (författare)
- 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
- Engelska.
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 48:1, s. 101-111
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Nyckelord
- Constant-weight codes
- Nonbinary codes
- Weight constraints
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas