On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code

2021 ◽  
Vol 57 (4) ◽  
pp. 331-340
Author(s):  
V.A. Zinoviev ◽  
D.V. Zinoviev
Keyword(s):  
Golay Code ◽  
Binary Golay Code

scholarly journals High-Speed Decoding of the Binary Golay Code

2013 ◽  
Vol 11 (3) ◽  
pp. 331-337 ◽  
Author(s):  
H.P. Lee ◽  
C.H. Chang ◽  
S.I. Chu
Keyword(s):  
High Speed ◽  
Golay Code ◽  
Binary Golay Code

Extended maximal self-orthogonal codes

2019 ◽  
Vol 11 (05) ◽  
pp. 1950052
Author(s):  
Yilmaz Durğun
Keyword(s):  
Dual Code ◽  
Weight Enumerator ◽  
Hamming Weight ◽  
Golay Code ◽  
Orthogonal Codes ◽  
Orthogonal Code ◽  
Binary Golay Code

Self-dual and maximal self-orthogonal codes over [Formula: see text], where [Formula: see text] is even or [Formula: see text](mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code. Using these results, we show that a self-dual code can also be constructed by gluing theory even if the sum of the lengths of the gluing components is odd. Furthermore, the (Hamming) weight enumerator [Formula: see text] of a self-dual code [Formula: see text] is given in terms of a maximal self-orthogonal code [Formula: see text], where [Formula: see text] is obtained by the extension of [Formula: see text].

scholarly journals The sextuply shortened binary Golay code is optimal

2018 ◽  
Vol 87 (2-3) ◽  
pp. 341-347 ◽  
Author(s):  
Patric R. J. Östergård
Keyword(s):  
Golay Code ◽  
Binary Golay Code

Classification of Certain Tail-Biting Generators for the Binary Golay Code

1998 ◽  
pp. 127-153 ◽  
Author(s):  
A. Robert Calderbank ◽  
G. David Forney ◽  
Alexander Vardy
Keyword(s):  
Golay Code ◽  
Tail Biting ◽  
Binary Golay Code
Sign in / Sign up

Export Citation Format

Share Document