An Extended Generalized Minimum Distance Decoding for Binary Linear Codes on a 4-Level Quantization over an AWGN Channel

2018 ◽  
Vol E101.A (8) ◽  
pp. 1235-1244
Author(s):  
Shunsuke UEDA ◽  
Ken IKUTA ◽  
Takuya KUSAKA ◽  
Md. Al-Amin KHANDAKER ◽  
Md. Arshad ALI ◽  
...  
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Binary Linear Codes ◽  
Awgn Channel ◽  
Level Quantization

scholarly journals Results on Binary Linear Codes With Minimum Distance 8 and 10

2011 ◽  
Vol 57 (9) ◽  
pp. 6089-6093 ◽  
Author(s):  
Iliya Georgiev Bouyukliev ◽  
Erik Jacobsson
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Binary Linear Codes

scholarly journals Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16

10.37236/9008 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Mustafa Gezek ◽  
Rudi Mathon ◽  
Vladimir D. Tonchev
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Projective Planes ◽  
Upper And Lower Bounds ◽  
Dual Codes ◽  
Binary Linear Codes ◽  
Incidence Matrices ◽  
Maximal Arc ◽  
Maximal Arcs ◽  
Even Order

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence matrices are derived. A lower bound on the minimum distance of the dual codes is proved, and it is shown that the bound is achieved if and only if the related maximal arc contains a hyperoval of the plane. The  binary linear codes of length 52 spanned by the incidence matrices of 2-$(52,4,1)$ designs associated with previously known and some newly found maximal arcs of degree 4 in projective planes of order 16 are analyzed and classified up to equivalence. The classification shows that some designs associated with maximal arcs in nonisomorphic planes generate equivalent codes. This phenomenon establishes new links between several of the known planes. A conjecture concerning the codes of maximal arcs in $PG(2,2^m)$ is formulated.

scholarly journals Isodual and self-dual codes from graphs

2021 ◽  
Vol 32 (1) ◽  
pp. 49-64
Author(s):  
S. Mallik ◽  
◽  
B. Yildiz ◽  
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Type I ◽  
Type Ii ◽  
Dual Codes ◽  
Generator Matrix ◽  
Combinatorial Interpretation ◽  
Binary Linear Codes ◽  
Graph Theoretic ◽  
Graph Classes

Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|A] where A is the adjacency matrix of a graph on n vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such linear codes to be Type I and Type II self-dual. Several examples of binary linear codes produced by well-known graph classes are given.

Sign in / Sign up

Export Citation Format

Share Document