Abstract
Recently a new notion was introduced on binary codes, called 4/-linearity, which explains why Kerdock codes and Delsarte-Goethals codes admit formal duals in spite of their nonlinearity. The Z/sub 4/-duals of these codes are new nonlinear codes which admit simpler decoding algorithms than the previously known formal duals. But their characterizations by means of algebraic equations are more complex. We give simpler algebraic characterizations of those codes. We next prove that the relationship between any 4/-linear code and its 4/-dual is stronger than the standard formal duality and deduce the weight enumerators of related generalized codes. >
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.
