New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products

Orbit codes, as special constant dimension codes, have attracted much attention due to their applications for error correction in random network coding. They arise as orbits of a subspace of F q n under the action of some subgroup of the finite general linear group GL n ( q ) . The aim of this paper...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Rendiconti del Circolo matematico di Palermo Ročník 73; číslo 1; s. 85 - 98
Hlavní autoři: Askary, Soleyman, Biranvand, Nader, Shirjian, Farrokh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.02.2024
Témata:
Algebra
Analysis
Applications of Mathematics
Geometry
Mathematics
Mathematics and Statistics
Linear groups
94B05
Non-Abelian orbit code
Algebraic coding theory
Primary 11T71
94A60
Random linear network coding
ISSN:0009-725X, 1973-4409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Orbit codes, as special constant dimension codes, have attracted much attention due to their applications for error correction in random network coding. They arise as orbits of a subspace of F q n under the action of some subgroup of the finite general linear group GL n ( q ) . The aim of this paper is to present constructions of large non-Abelian orbit codes having the maximum possible distance. The properties of imprimitive wreath products and wreathed tensor products of groups are employed to select certain types of subspaces and their stabilizers, thereby providing a systematic way of constructing orbit codes with optimum parameters. We also present explicit examples of such constructions which improve the parameters of the construction already obtained in Climent et al. (Cryptogr Commun 11:839-852, 2019).
ISSN:0009-725X
1973-4409
DOI:10.1007/s12215-023-00903-6