Certain binary minimal codes constructed using simplicial complexes

DOI10.3934/AMC.2023044MaRDI QIDQ6418801zbMATH OpenFDO

Publication date 28 November 2022

Full work available at URL https://doi.org/10.3934/AMC.2023044

Combinatorial aspects of simplicial complexes (05E45) Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: In this article, we work over the non-chain ring

m a t h c a l R = m a t h b b Z_{2} [u] / l a n g l e u^{3} - u a n g l e

. Let

m i n m a t h b b N

and let

L, M, N s u b s e t e q [m] := 1, 2, d o t s, m

. For

X s u b s e t e q [m]

, define

D e l t a_{X} := v i n m a t h b b Z_{2}^{m} : e x t S u p p (v) s u b s e t e q X

and

, a subset of

m a t h c a l R^{m}

, where

D_{1} i n D e l t a_{L}, D e l t a_{L}^{c}, D_{2} i n D e l t a_{M}, D e l t a_{M}^{c}, D_{3} i n D e l t a_{N}, D e l t a_{N}^{c}

. The linear code

C_{D}

over

m a t h c a l R

defined by

is studied for each

D

. For instance, we obtain the Lee weight distribution of

C_{D}

. The Gray map

P h i : m a t h c a l R l o n g r i g h t a r r o w m a t h b b Z_{2}^{3}

given by

P h i (a + u b + u^{2} d) = (a + b, b + d, d)

is utilized to derive a binary linear code, namely,

P h i (C_{D})

for each

D

. Sufficient conditions for each of these binary linear codes to be minimal are obtained. In fact, sufficient conditions for minimality are mild in nature, for example,

v e r t L v e r t, v e r t M v e r t, v e r t N v e r t < m - 2

is a set of conditions for minimality of

P h i (C_{D})

for each

D

. Moreover, these binary codes are self-orthogonal if each of

L, M

and

N

is nonempty.

Recommendations

Cited in

(11)

This page was built for publication: Certain binary minimal codes constructed using simplicial complexes

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