Abstract
We study weight distributions of shifts of codes from a well-known family: the 3-error-correcting binary nonlinear Goethals-like codes of length n e 2m, where m ≥ 6 is even. These codes have covering radius ρ e 6. We know the weight distribution of any shift of weight i e 1, 2, 3, 5, or 6. For a shift of weight 4, the weight distribution is uniquely defined by the number of leaders in this shift, i.e., the number of vectors of weight 4. We also consider the weight distribution of shifts of codes with minimum distance 7 obtained by deleting any one position of a Goethals-like code of length n.
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.
