A survey on quaternary codes and their binary images

Download
2009
Özkaya, Derya
Certain nonlinear binary codes having at least twice as many codewords as any known linear binary code can be regarded as the binary images of linear codes over Z4. This vision leads to a new concept in coding theory, called the Z4-linearity of binary codes. This thesis is a survey on the linear quaternary codes and their binary images under the Gray map. The conditions for the binary image of a linear quaternary code to be linear are thoroughly investigated and the Z4-linearity of the Reed-Muller and Hamming codes is discussed. The contribution of this study is a simplification on the testing method of linearity conditions via a few new lemmas and propositions. Moreover, binary images (of length 8) of all linear quaternary codes of length 4 are analyzed and it is shown that all 184 binary codes in the nonlinear subset of these images are worse than the (8, 4) Hamming code. This thesis also includes the Hensel lift and Galois ring which are important tools for the study of quaternary cyclic codes. Accordingly, the quaternary cyclic versions of the well-known nonlinear binary codes such as the Kerdock and Preparata codes and their Z4-linearity are studied in detail.

Suggestions

Basic cryptanalysis methods on block ciphers
Çelik, Dilek; Doğanaksoy, Ali; Department of Cryptography (2010)
Differential cryptanalysis and linear cryptanalysis are the first significant methods used to attack on block ciphers. These concepts compose the keystones for most of the attacks in recent years. Also, while designing a cipher, these attacks should be taken into consideration and the cipher should be created as secure against them. Although di fferential cryptanalysis and linear cryptanalysis are still important, they started to be ine cient due to the improvements in the technology. So, these attacks are ...
A concatenated construction of linear complementary pair of codes
GÜNERİ, CEM; Özbudak, Ferruh; Sacikara, Elif (Springer Science and Business Media LLC, 2019-09-01)
A concatenated construction for linear complementary dual codes was given by Carlet et al. using the so-called isometry inner codes. Here, we obtain a concatenated construction to the more general family, linear complementary pair of codes. Moreover, we extend the dual code description of Chen et al. for concatenated codes to duals of generalized concatenated codes. This allows us to use generalized concatenated codes for the construction of linear complementary pair of codes.
An Investigation on belief propagation decoding of polar codes
Doğan, Orkun; Diker Yücel, Melek; Department of Electrical and Electronics Engineering (2015)
Polar codes are provably symmetric capacity achieving codes for any given binary input discrete memoryless channel, with low encoding and decoding complexities. Polar codes introduced by Erdal Arıkan in 2009 are based on the channel polarization. N binary channels are synthesized out of N copies of binary input discrete memoryless channels, such that as N goes to infinity each of the synthesized channel’s capacity goes to either 0 or 1; i.e., the channels are seen purely as noisy or noiseless channels. Thes...
On statistical analysis of synchronous stream ciphers
Sönmez Turan, Meltem; Doğanaksoy, Ali; Department of Cryptography (2008)
Synchronous stream ciphers constitute an important class of symmetric ciphers. After the call of the eSTREAM project in 2004, 34 stream ciphers with different design approaches were proposed. In this thesis, we aim to provide a general framework to analyze stream ciphers statistically. Firstly, we consider stream ciphers as pseudo random number generators and study the quality of their output. We propose three randomness tests based on one dimensional random walks. Moreover, we theoretically and experimenta...
Results on complexity of multiplication over finite fields
Cenk, Murat; Özbudak, Ferruh; Department of Cryptography (2009)
Let n and l be positive integers and f (x) be an irreducible polynomial over Fq such that ldeg( f (x)) < 2n - 1, where q is 2 or 3. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f (x)^l. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over Fq. We give improved formulae to multiply polynomials of small degree over Fq. In particular we improve the best known multiplication complexi...
Citation Formats
D. Özkaya, “A survey on quaternary codes and their binary images,” M.S. - Master of Science, Middle East Technical University, 2009.