Cyclic subspace codes via subspace polynomials

2017-11-01
Otal, KAMİL
Özbudak, Ferruh
Subspace codes have been intensely studied in the last decade due to their application in random network coding. In particular, cyclic subspace codes are very useful subspace codes with their efficient encoding and decoding algorithms. In a recent paper, Ben-Sasson et al. gave a systematic construction of subspace codes using subspace polynomials. In this paper, we mainly generalize and improve their result so that we can obtain larger codes for fixed parameters and also we can increase the density of some possible parameters. In addition, we give some relative remarks and explicit examples.
DESIGNS CODES AND CRYPTOGRAPHY

Suggestions

An Analysis on Luby transform encoding-decoding algorithms and proposals for more efficient practical usage /
Bülbüldere, Mehmet; Diker Yücel, Melek; Department of Electrical and Electronics Engineering (2015)
We study the encoding and decoding algorithms of Luby Transform Codes and analyze the performance of these codes. Luby Transform Coding technique is one of the classes of rateless codes. Depending on the use scenario, higher data rates can be obtained by using LT codes instead of using only conventional fixed rate codes. Segmentation of data to be transmitted and channel conditions have major effects on the speed of transmission of whole data. Throughput, data rate, decoding success ratio results, which are...
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Lopez-Permouth, Sergio R.; Ozadam, Hakan; Özbudak, Ferruh; SZABO, Steve (2013-01-01)
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p(a), m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding such sets in the case that a = 2 is given. This explicitly gives the Hamming distance of all cyclic codes of le...
The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
Guneri, Cem; Özbudak, Ferruh (2013-02-01)
Following Jensen's work from 1985, a quasi-cyclic code can be written as a direct sum of concatenated codes, where the inner codes are minimal cyclic codes and the outer codes are linear codes. We observe that the outer codes are nothing but the constituents of the quasi-cyclic code in the sense of Ling-Sole. This concatenated structure enables us to recover some earlier results on quasi-cyclic codes in a simple way, including one of our recent results which says that a quasi-cyclic code with cyclic constit...
Linear codes from weakly regular plateaued functions and their secret sharing schemes
Mesnager, Sihem; Özbudak, Ferruh; Sinak, Ahmet (2019-03-01)
Linear codes, the most significant class of codes in coding theory, have diverse applications in secret sharing schemes, authentication codes, communication, data storage devices and consumer electronics. The main objectives of this paper are twofold: to construct three-weight linear codes from plateaued functions over finite fields, and to analyze the constructed linear codes for secret sharing schemes. To do this, we generalize the recent contribution of Mesnager given in (Cryptogr Commun 9(1):71-84, 2017...
Aspects of coding theory with two recent applications
Bodur, Şeyma; Özbudak, Ferruh; Department of Cryptography (2019)
Coding Theory is a deep subject having a lot of applications in different areas. In this thesis we explain some background for two recent applications: Code base Cryptography, Entanglement Assisted Quantum Error-Correcting Codes (EAQECC).
Citation Formats
K. Otal and F. Özbudak, “Cyclic subspace codes via subspace polynomials,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 191–204, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38733.