Linear size optimal q-ary constant-weight codes and constant-composition codes
An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at least 2w-1. When d ≥ 2w, the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of d=2w-1 has been solved previously on...
Saved in:
Main Authors: | Ling, Alan C. H., Chee, Yeow Meng, Dau, Son Hoang, Ling, San |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/92390 http://hdl.handle.net/10220/7637 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Constructions for q-ary constant-weight codes
by: Chee, Yeow Meng, et al.
Published: (2009) -
The sizes of optimal q-ary codes of weight three and distance four : a complete solution
by: Ling, Alan C. H., et al.
Published: (2009) -
On the construction of nonbinary constant-weight codes
by: Dau, Son Hoang
Published: (2008) -
The PBD-closure of constant-composition codes
by: Ling, Alan C. H., et al.
Published: (2009) -
Group divisible codes and their application in the construction of optimal constant-composition codes of weight three
by: Ling, Alan C. H., et al.
Published: (2009)