Circuit lower bounds and linear codes.
Page 1
Displaying 1 – 13 of 13
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Harada, Masaaki, Lam, Clement, Munemasa, Akihiro, Tonchev, Vladimir D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Codes and designs from triangular graphs and their line graphs
Washiela Fish, Khumbo Kumwenda, Eric Mwambene (2011)
Open Mathematics
For any prime p, we consider p-ary linear codes obtained from the span over p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.
Codes and projective multisets.
Dodunekov, Stefan, Simonis, Juriaan (1998)
The Electronic Journal of Combinatorics [electronic only]
Codes correcteurs d'erreurs.
Francois Sigrist (1993)
Elemente der Mathematik
Codes de Goppa
Jean-Francis MICHON (1983/1984)
Seminaire de Théorie des Nombres de Bordeaux
Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game.
Schauz, Uwe (2011)
The Electronic Journal of Combinatorics [electronic only]
Combinatorial aspects of code loops
Petr Vojtěchovský (2000)
Commentationes Mathematicae Universitatis Carolinae
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove...
Completing codes
A. Restivo, S. Salemi, T. Sportelli (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Construction of codes by lattice valued fuzzy sets.
Žižović, Mališa, Lazarević, Vera (2005)
Novi Sad Journal of Mathematics
Construction of Optimal Linear Codes by Geometric Puncturing
Maruta, Tatsuya (2013)
Serdica Journal of Computing
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.
Constructions of digital nets
Harald Niederreiter, Chaoping Xing (2002)
Acta Arithmetica
Cycle indicators of linear groups and enumeration of linear codes. (Zyklenzeiger linearer Gruppen und Abzählung linearer Codes.)
Fripertinger, Harald (1994)
Séminaire Lotharingien de Combinatoire [electronic only]
Currently displaying 1 – 13 of 13
Page 1