Binary LCD Codes from Z_2Z_2[u]

03/26/2019
by   Hu Peng, et al.
0

Linear complementary dual (LCD) codes over finite fields are linear codes satisfying C∩ C^={0}. We generalize the LCD codes over finite fields to Z_2Z_2[u]-LCD codes over the ring Z_2×(Z_2+uZ_2). Under suitable conditions, Z_2Z_2[u]-linear codes that are Z_2Z_2[u]-LCD codes are characterized. We then prove that the binary image of a Z_2Z_2[u]-LCD code is a binary LCD code. Finally, by means of these conditions, we construct new binary LCD codes using Z_2Z_2[u]-LCD codes, most of which have better parameters than current binary LCD codes available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2018

Some new bounds on LCD codes over finite fields

In this paper, we show that LCD codes are not equivalent to linear codes...
research
03/19/2021

A new method for constructing linear codes with small hulls

The hull of a linear code over finite fields is the intersection of the ...
research
06/13/2020

On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels

Finite-length binary codes of four codewords are studied for memoryless ...
research
04/15/2019

Wajsberg algebras arising from binary block codes

In this paper we presented some connections between BCK-commutative boun...
research
07/06/2018

Design of Low-Complexity Convolutional Codes over GF(q)

This paper proposes a new family of recursive systematic convolutional c...
research
01/30/2020

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes

Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in ...
research
08/29/2018

Decoding binary Reed-Muller codes via Groebner bases

The binary Reed-Muller codes can be characterized as the radical powers ...

Please sign up or login with your details

Forgot password? Click here to reset