Abstract
Among the many aspects of coding theory Jack van Lint has studied intensively are some generalizations of Preparata and Kerdock codes (see Baker et al. (1983), Cameron and Van Lint (1991) and Van Lint (1983)). There are still many open problems concerning these. This note is a brief discussion of problems and new results involving orthogonal spreads, translation planes and associated generalized Kerdock 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.
