Abstract
A method for constructing optimal almost equisymbol codes based on difference matrices is proposed. Some of these codes generate previously unknown optimal equidistant codes satisfying the Plotkin bound. As a consequence, they generate new resolvable balanced incomplete block designs.
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
