On the parameters of intertwining codes

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.

Recommendations

Cites work

Cited in

(1)

On decoding procedures of intertwining codes

Describes a project that uses

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)