Abstract
Let [ n, k, d; q]-code denote a q-ary linear code, with length n, dimension k and minimum distance d. Griesmer's bound is well known as a lower bound on n for given integers k, d and q. Linear codes meeting the Griesmer bound are called optimal linear codes. This paper is a survey on the construction of optimal linear codes. Some relations among optimal linear codes, linear programming, maxhypers and minihypers are investigated. Maxhypers and minihypers are very useful in obtaining and characterizing optimal linear codes. Furthermore, we present many optimal linear codes which are constructed using these relations and l intersectional empty sets.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
