Paper Info
Title
On Some Linear Codes.
Abstract
Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Masseyu0027s theoremcite{Massey2}, 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 codes. We will give bound on $LCD[n,k]_3$. We will also discuss the cases when this bound is attained.
Year
Venue
DocType
2018
arXiv: Information Theory
Journal
Volume
Citations 
PageRank 
abs/1801.05271
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Nitin S. Darkunde101.01