The PBD-closure of constant-composition codes
We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite fa...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91732 http://hdl.handle.net/10220/6036 http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EBSCO_APH&id=doi:&genre=&isbn=&issn=00189448&date=2007&volume=53&issue=8&spage=2685&epage=2692&aulast=Yeow&aufirst=Meng%20Chee&auinit=&title=IEEE%20Transactions%20on%20Information%20Theory&atitle=The%20PBD%2DClosure%20of%20Constant%2DComposition%20Codes%2E |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Internet
https://hdl.handle.net/10356/91732http://hdl.handle.net/10220/6036
http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EBSCO_APH&id=doi:&genre=&isbn=&issn=00189448&date=2007&volume=53&issue=8&spage=2685&epage=2692&aulast=Yeow&aufirst=Meng%20Chee&auinit=&title=IEEE%20Transactions%20on%20Information%20Theory&atitle=The%20PBD%2DClosure%20of%20Constant%2DComposition%20Codes%2E