Abstract
We classify the neighbour-transitive codes in Johnson graphs $$J(v,k)$$ of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree $$v$$ and does not occur in an infinite family of two-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length $$v$$ and number of code words. We construct an additional five neighbour-transitive codes with minimum distance two admitting such a group. All 27 codes are $$t$$ -designs with $$t$$ at least two.
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.
