Results 1 to 10 of about 3,668,025 (297)
Minimal Linear Codes Constructed from Sunflowers [PDF]
Sunflower in coding theory is a class of important subspace codes and can be used to construct linear codes. In this paper, we study the minimality of linear codes over Fq constructed from sunflowers of size s in all cases.
Xia Wu, Wei Lu
doaj +2 more sources
SOME NEW CONSTRUCTIONS OF LINEAR CODES INCLUDING A WIDE FAMILY OF MDS CODES [PDF]
Let $mathbb{Z}_p$ be the finite field of integers modulo $p$, where $p>3$ is a prime integer. This paper presents new constructions of linear codes over $mathbb{Z}_p$.
A. Rafieepour, M. Mazrooei
doaj +1 more source
Random linear codes in steganography [PDF]
Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code.
Kamil Kaczyński
doaj +1 more source
A Unique Representation of Cyclic Codes over GR(pn,r)
Let R be a Galois ring, GR(pn,r), of characteristic pn and of order pnr. In this article, we study cyclic codes of arbitrary length, N, over R. We use discrete Fourier transform (DFT) to determine a unique representation of cyclic codes of length, N, in ...
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Multi-block Two Repeated Fixed Burst Error Correcting Linear Codes
During the digital transmission of information, errors are bound to occur. The errors may be random or burst errors. In this paper, we have obtained necessary and sufficient conditions for the existence of linear codes over that are capable of ...
Ritu Arora +3 more
doaj +1 more source
Partial IDS decoding based on the base graph of protograph LDPC codes
The residual belief propagation (RBP) algorithm, which is the most classic informed dynamic scheduling strategy, achieves outstanding performance in error correction and can drastically accelerate convergence speed.
Shuo Liang, Xingcheng Liu, Suipeng Xie
doaj +1 more source
Some Results on Self-Complementary Linear Codes
Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes.
Maria Pashinska-Gadzheva +2 more
doaj +1 more source
Linear Codes over Finite Rings
In this paper we present a construction technique of cyclic, BCH, alternat, Goppa and Srivastava codes over a local finite commutative rings with identity.
A.A. de Andrade, R. Palazzo Jr.
doaj +1 more source
Projective parameterized linear codes
In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals,
González Sarabia Manuel +2 more
doaj +1 more source

