AI Chat AI Image Generator AI Video Text to Speech

On the Density of Codes over Finite Chain Rings

12/19/2022

∙

by Anna-Lena Horlemann, et al.

∙

∙

We determine the asymptotic proportion of free modules over finite chain rings with good distance properties and treat the asymptotics in the code length n and the residue field size q separately. We then specialize and apply our technique to rank metric codes and to Hamming metric codes.

Anna-Lena Horlemann
7 publications
Violetta Weger
20 publications
Nadja Willenborg
4 publications

page 1

page 2

page 3

page 4

research

∙ 06/17/2021

Density of Free Modules over Finite Chain Rings

In this paper we focus on modules over a finite chain ring ℛ of size q^s...

0 Eimear Byrne, et al. ∙

research

∙ 08/22/2022

Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces

We investigate the asymptotic density of error-correcting codes with goo...

0 Anina Gruica, et al. ∙

research

∙ 06/27/2019

On the Sparseness of Certain MRD Codes

We determine the proportion of [3× 3;3]-MRD codes over F_q within the s...

0 Heide Gluesing-Luerssen, et al. ∙

research

∙ 11/29/2017

F_q[G]-modules and G-invariant codes

If F_q is a finite field and G is a subgroup of the linear automorphisms...

0 Elias Javier Garcia Claro, et al. ∙

research

∙ 05/10/2021

The Typical Non-Linear Code over Large Alphabets

We consider the problem of describing the typical (possibly) non-linear ...

0 Anina Gruica, et al. ∙

research

∙ 11/24/2020

Non-Invertible-Element Constacyclic Codes over Finite PIRs

In this paper we introduce the notion of λ-constacyclic codes over finit...

0 Hongwei Liu, et al. ∙

research

∙ 09/05/2023

Topologies for Error-Detecting Variable-Length Codes

Given a finite alphabet A, a quasi-metric d over A^*, and a non-negative...

0 Jean Néraud, et al. ∙