Abstract
Uniform constant composition (UCC) codes are introduced, which are p-ary constant composition codes with block length mp where each p-ary symbol appears exactly m times in each codeword, being m a positive integer and p a prime. UCC codes are derived from a new class of p-ary repeated-root cyclic codes and two constructions are presented. Both constructions are at least asymptotically optimal with increasing p when compared with known best bounds for constant composition codes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
