Abstract
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. A sharpening to the linear programming bound for linear codes in the Lee metric is introduced, which is based on an invariance-type property of Lee compositions of a linear code. Using this property, additional equality constraints are introduced into the linear programming problem, which give a tighter bound for linear Lee 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
