Abstract
Abstract This paper discusses Varshamov-Gilbert bound, sphere-packing bound and some other problems of burst-error-correcting codes with weight constraints under a new metric. The new metric, introduced in an earlier paper, is defined in terms of suitable partition of the alphabet, the ring Z q, of integers mod q. In general, different partitions of the same alphabet lead to different metrices. The partition of the alphabet {0, 1, 2, ⃛, q − 1} given by {0} and {l, 2, ⃛, q − 1} determines Hamming metric. Also, for the partition ρ L = {B 0, B 1, ⃛,B⌞q/2⌟} where B 0 = {0} and B 0,= {i, q −i} for i = 1, 2 ⃛,⌞q/2⌟ the metric reduces to Lee metric.
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
