Abstract
Any partition of the coordinate set of a linear code is shown to correspond to a set of generalized MacWilliams identities. Thus, a well-chosen partition yields a promising method to settle existence and uniqueness problems. A short proof of an extension of the Assmus-Mattson theorem is given. In the nonlinear case, a generalization of the Delsarte inequalities is obtained.
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.
