Distance-regular graphs and new block designs obtained from the Mathieu groups
From MaRDI portal
Publication:6122404
DOI10.1007/s00200-022-00542-xarXiv2101.02790OpenAlexW4211139694MaRDI QIDQ6122404
Dean Crnković, Andrea Švob, Nina Mostarac
Publication date: 1 March 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.02790
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Group actions on combinatorial structures (05E18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- On some transitive combinatorial structures constructed from the unitary group \(U(3,3)\)
- Improved partial permutation decoding for Reed-Muller codes
- t-designs from the large Mathieu groups
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- On some distance-regular graphs with many vertices
- Decoding the Mathieu group \(M_{12}\)
- Symmetry codes over GF(3) and new five-designs
- The Finite Simple Groups
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Fundamentals of Error-Correcting Codes
- Some symmetric designs invariant under the small Ree groups
- New 5-designs
- On a new family of symmetry codes and related new five-designs
- Permutation Decoding of Systematic Codes
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes