On Some Ternary LCD Codes

02/08/2018
by   Nitin S. Darkunde, et al.
0

The main aim of this paper is to study LCD codes. Linear code with complementary dual(LCD) are those codes which have their intersection with their dual code as {0}. In this paper we will give rather alternative proof of Massey's theorem8, which is one of the most important characterization of LCD codes. Let LCD[n,k]_3 denote the maximum of possible values of d among [n,k,d] ternary LCD codes. In 4, authors have given upper bound on LCD[n,k]_2 and extended this result for LCD[n,k]_q, for any q, where q is some prime power. We will discuss cases when this bound is attained for q=3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2022

Enumeration of extended irreducible binary Goppa codes

The family of Goppa codes is one of the most interesting subclasses of l...
research
02/06/2022

Galois LCD codes over mixed alphabets

We study (Galois) linear complementary dual codes over mixed alphabets a...
research
03/11/2018

Maximum Weight Spectrum Codes

We prove a conjecture recently proposed by Shi, Zhu, Solé and Cohen on l...
research
08/27/2022

Linear codes associated with the Desarguesian ovoids in Q^+(7,q)

The Desarguesian ovoids in the orthogonal polar space Q^+(7,q) with q ev...
research
11/25/2021

On the dimension and structure of the square of the dual of a Goppa code

The Goppa Code Distinguishing (GD) problem asks to distinguish efficient...
research
11/02/2022

Exact Completeness of LP Hierarchies for Linear Codes

Determining the maximum size A_2(n,d) of a binary code of blocklength n ...
research
12/03/2020

Optimal Ternary Linear Complementary Dual Codes

Linear complementary dual (LCD) codes introduced by Massey are the codes...

Please sign up or login with your details

Forgot password? Click here to reset