Abstract
We obtain an upper bound on the maximum attainable minimum distance for a k -ary code for a certain class of distance functions. This class includes the α th power of the Lee distance (0 < α ≤ 1).
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
