Equidistant permutation group codes

We study permutation codes which are groups and all of whose non-identity code elements have the same number of fixed points. It follows that over certain classes of groups such permutation codes exist.

Saved in:
Bibliographic Details
Published inDesigns, codes, and cryptography Vol. 90; no. 12; pp. 2841 - 2859
Main Authors Jafari, Fatemeh, Abdollahi, Alireza, Bagherian, Javad, Khatami, Maryam, Sobhani, Reza
Format Journal Article
LanguageEnglish
Published New York Springer US 01.12.2022
Springer Nature B.V
Subjects
Coding and Information Theory
Computer Science
Cryptology
Discrete Mathematics in Computer Science
Group theory
Permutations
Special Issue: On Coding Theory and Combinatorics: In Memory of Vera Pless
94B25
05E18
05A05
Positive type
Permutation groups
Equidistant permutation codes
Online AccessGet full text

Cover

More Information
Summary:We study permutation codes which are groups and all of whose non-identity code elements have the same number of fixed points. It follows that over certain classes of groups such permutation codes exist.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-021-00997-y