On the parameters of intertwining codes

DOI10.26493/1855-3974.1547.454zbMATH Open1461.94099arXiv1711.04104OpenAlexW2795472279WikidataQ129241978 ScholiaQ129241978MaRDI QIDQ5225022FDOQ5225022

Authors: Cheryl E. Praeger, S. P. Glasby

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: Let

F

be a field and let

F^{r i m e s s}

denote the space of

r i m e s s

matrices over

F

. Given equinumerous subsets

m a t h c a l A = A_{i} m i d i i n I s u b s e t e q F^{r i m e s r}

and

m a t h c a l B = B_{i} m i d i i n I s u b s e t e q F^{s i m e s s}

we call the subspace

C (m a t h c a l A, m a t h c a l B) := X i n F^{r i m e s s} m i d A_{i} X = X B_{i} m f o r i i n I

an emph{intertwining code}. We show that if

C (m a t h c a l A, m a t h c a l B) e 0

, then for each

i i n I

, the characteristic polynomials of

A_{i}

and

B_{i}

and share a nontrivial factor. We give an exact formula for

k = d i m (C (m a t h c a l A, m a t h c a l B))

and give upper and lower bounds. This generalizes previous work in this area. Finally we construct intertwining codes with large minimum distance when the field is not `too small'. We give examples of codes where

d = r s / k = 1 / R

is large where the minimum distance, dimension, and rate of the linear code

C (m a t h c a l A, m a t h c a l B)

by

d

,

k

, and

R = k / r s

, respectively.

Full work available at URL: https://arxiv.org/abs/1711.04104

Recommendations

zbMATH Keywords

distance dimension linear code

Mathematics Subject Classification ID

Combinatorial probability (60C05) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

Cited In (1)

On decoding procedures of intertwining codes

Uses Software

MathOverflow

This page was built for publication: On the parameters of intertwining codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225022)