# Increasing the Minimum Distance of Codes by Twisting

@article{Akbari2015IncreasingTM, title={Increasing the Minimum Distance of Codes by Twisting}, author={Marzieh Akbari and Neil I. Gillespie and Cheryl E. Praeger}, journal={Electron. J. Comb.}, year={2015}, volume={25}, pages={3} }

Twisted permutation codes, introduced recently by the second and third authors, belong to the family of frequency permutation arrays. Like some other codes in this family, such as the repetition permutation codes, they are obtained by a repetition construction applied to a smaller code (but with a "twist" allowed). The minimum distance of a twisted permutation code is known to be at least the minimum distance of a corresponding repetition permutation code, but in some instances can be larger…

## 3 Citations

### Distance increasing mapping for variable distance block code

- Computer Science, BusinessIET Commun.
- 2020

The construction of distance increasing mapping (DIM) such that the proposed code is a variable distance modified block code with a code rate equal to 1/2 and an algorithm for such DIM is developed here.

### Decoding Algorithm for Modified Linear Block Code with Syndrome Polynomial

- Computer Science2019 International Conference on Advances in Computing, Communication and Control (ICAC3)
- 2019

This article gives the encoding and decoding methodology for a Modified Linear Block Code (MLBC) from the solution space of a completely controllable discrete-time system for any k length message…

### Distance Preserving Mapping and Simple Intelligent Decoder for Modified Linear Block Code

- Computer Science
- 2019

A modified linear block code is proposed from such DPM for which the distance preserving property is observed and an Intelligent Decoder (ID) is proposed along with the construction of decoding algorithm.

## References

SHOWING 1-10 OF 21 REFERENCES

### CHARACTERISATION OF A FAMILY OF NEIGHBOUR TRANSITIVE CODES

- Mathematics, Computer Science
- 2014

A family of neighbour transitive codes, in particular, the alphabet almost simple neighbour transitives codes with minimum distance at least 3, and for which the group X has a non-trivial intersection with the base group of Aut().If C is such a code, it is shown that, up to equivalence, there exists a subcode � that can be completely described, and it is proved that any finite group can be identified in a natural way with a neighbours transitive code.

### Twisted permutation codes

- Computer Science, Mathematics
- 2014

It is shown that a lower bound for the minimum Distance of a twisted permutation code is the minimum distance of a repetition permutations code.

### Decoding Frequency Permutation Arrays Under Chebyshev Distance

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2010

This paper first proves lower and upper bounds on the size of FPA, then gives several constructions of FPAs, and some of them come with efficient encoding and decoding capabilities and are shown to be locally decodable.

### Frequency permutation arrays

- Mathematics, Computer Science
- 2005

This article establishes basic properties of FPAs, and provides direct constructions for FPAs using a range of combinatorial objects, including polynomials over finite fields, combinatorially designs, and codes.

### Neighbour transitivity on codes in Hamming graphs

- Mathematics, Computer ScienceDes. Codes Cryptogr.
- 2013

This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code, and obtains sufficient conditions for a neighbour transitive group to fix the code setwise.

### Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme

- Computer ScienceIEEE Transactions on Information Theory
- 2010

This work defines codes protecting against spike errors, called limited-magnitude rank-modulation codes (LMRM codes), and presents several constructions for these codes, some resulting in optimal codes.

### Equidistant frequency permutation arrays and related constant composition codes

- Computer ScienceDes. Codes Cryptogr.
- 2010

This paper studies the special class of equidistant constant composition codes of type CCC(n, d, μm) (where n = mμ), which correspond toequidistant frequency permutation arrays and establishes various properties of these objects and gives constructions for optimal families of codes.

### Error-correcting codes for rank modulation

- Computer Science2008 IEEE International Symposium on Information Theory
- 2008

It is shown that the adjacency graph of permutations is a subgraph of a multi-dimensional array of a special size, a property that enables code designs based on Lee- metric codes.

### The geometry of the classical groups

- Mathematics
- 1992

classical groups Download eBook pdf epub tuebl mobi. A short bibliography on classical groups QMUL Maths. Geometry of G P V. handbook of computational group theory Download eBook. Classical Groups…