Cyclic subspace codes via subspace polynomials

Date

2017-11-01

Author

Otal, KAMİL
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

56
views

0
downloads

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.

Subject Keywords

Random network coding, Subspace codes, Constant dimension codes, Grassmannian, Cyclic subspace codes, Subspace polynomials

URI

https://hdl.handle.net/11511/38733

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-016-0297-1

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

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...
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...
Belief propagation decoding of polar codes under factor graph permutations Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018) Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2022-01-01) IEEESpatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, followed by rearranging and concatenating the partitioned components in a convolutional manner. The number of partitioned components determines the memory of SC codes. In this paper, we investigate the relation between the performance of SC codes and the...

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.