Decoding twisted permutation codes

04/14/2023
by   Robert F. Bailey, et al.
0

We consider twisted permutation codes, a class of frequency permutation arrays obtained from finite groups with multiple permutation representations of the same degree, introduced by Gillespie, Praeger and Spiga (and later studied by Akbari, Gillespie and Praeger), and develop a decoding algorithm for such codes based on earlier work of the first author for permutation group codes. In particular, we show how to implement this algorithm for an infinite family of groups considered by Akbari, Gillespie and Praeger.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Permutation codes over finite fields

In this paper we describe a class of codes called permutation codes. Th...
research
02/10/2023

New advances in permutation decoding of first-order Reed-Muller codes

In this paper we describe a variation of the classical permutation decod...
research
10/29/2020

Capacity-achieving codes: a review on double transitivity

Recently it was proved that if a linear code is invariant under the acti...
research
06/19/2018

A unifying method for the design of algorithms canonizing combinatorial objects

We devise a unified framework for the design of canonization algorithms....
research
06/08/2018

List-decoding homomorphism codes with arbitrary codomains

The codewords of the homomorphism code aHom(G,H) are the affine homomorp...
research
05/11/2020

Towards Efficient Normalizers of Primitive Groups

We present the ideas behind an algorithm to compute normalizers of primi...
research
08/22/2022

Improved constructions of permutation and multi-permutation codes correcting a burst of stable deletions

Permutation codes and multi-permutation codes have been widely considere...

Please sign up or login with your details

Forgot password? Click here to reset