## Abstract

Let R be a (possibly noncommutative) finite principal ideal ring. Via a total ordering of the ring elements and an ordered basis a lexicographic ordering of the module R^{n} is produced. This is used to set up a greedy algorithm that selects vectors for which all linear combinations with the previously selected vectors satisfy a pre-specified selection property and updates the to-be-constructed code to the linear hull of the vectors selected so far. The output is called a lexicode. This process was discussed earlier in the literature for fields and chain rings. In this paper we investigate the properties of such lexicodes over finite principal ideal rings and show that the total ordering of the ring elements has to respect containment of ideals for the algorithm to produce meaningful results. Only then it is guaranteed that the algorithm is exhaustive and thus produces codes that are maximal with respect to inclusion. It is further illustrated that the output of the algorithm heavily depends on the total ordering and chosen basis.

Original language | English |
---|---|

Pages (from-to) | 2661-2676 |

Number of pages | 16 |

Journal | Designs, Codes, and Cryptography |

Volume | 86 |

Issue number | 11 |

DOIs | |

State | Published - Nov 1 2018 |

### Bibliographical note

Publisher Copyright:© 2018, Springer Science+Business Media, LLC, part of Springer Nature.

## Keywords

- Greedy algorithm
- Lexicodes
- Principal left ideal rings

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics