Abstract
A new lower bound for the parameters of (nonlinear) q -ary codes is introduced. For some q this bound improves on the Varshamov-Gilbert bound, the modular algebraic-geometric bound, and the very recent Vl\breve{a}duts bound.
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
