Equidistant permutation group codes
From MaRDI portal
Publication:2099153
DOI10.1007/s10623-021-00997-yOpenAlexW4205833074WikidataQ114849807 ScholiaQ114849807MaRDI QIDQ2099153
R. Sobhani, Maryam Khatami, Alireza Abdollahi, Fatemeh Jafari, Javad Bagherian
Publication date: 23 November 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00997-y
Permutations, words, matrices (05A05) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitionen endlicher Gruppen
- Die Nilpotenz der \(H_ p\)-Gruppen
- On a finite group with a partition
- Equidistant frequency permutation arrays and related constant composition codes
- A construction of optimal constant composition codes
- Suzuki 2-groups
- On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
- Bounds for permutation arrays
- Partitions and other coverings of finite groups.
- Constructions for permutation codes in powerline communications
- On constant composition codes
- \(3\)-designs from PGL\((2,q)\)
- A criterion for the existence of a non-trivial partition of a finite group with applications to finite reflection groups
- Die Suzukigruppen und ihre Geometrien. Vorlesung Sommersemester 1965 in Mainz
- Products of Sylow Subgroups in Suzuki and Ree Groups
- On the Labeling Problem of Permutation Group Codes Under the Infinity Metric
- Frequency permutation arrays
- The Depth of Subgroups of Suzuki Groups
- Combinatorial Constructions of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- The Asymptotic Behaviour of Equidistant Permutation Arrays
- Endliche Gruppen I
This page was built for publication: Equidistant permutation group codes