Abstract
Let [n, k, d]/sub q/-codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this article, 31 new quaternary (q=4) codes are constructed which improve the respective lower bounds on minimum distance in Brouwer's tables.
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
