Results 11 to 20 of about 722 (41)
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A. +1 more
doaj +1 more source
A Family Of Low Density Matrices In Lagrangian–Grassmannian
Special Matrices, 2018 The aim of this paper is twofold. First, we show a connection between the Lagrangian- Grassmannian variety geometry defined over a finite field with q elements and the q-ary Low-Density Parity- Check codes. Second, considering the Lagrangian-Grassmannian
Carrillo-Pacheco Jesús +1 more
doaj +1 more source
On extremal self-dual ternary codes of length 48 [PDF]
, 2011 All extremal ternary codes of length 48 that have some automorphism of prime order $p\geq 5$ are equivalent to one of the two known codes, the Pless code or the extended quadratic residue ...
Nebe, Gabriele
core +4 more sources
DAGS: Key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology, 2018 Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo +12 more
doaj +1 more source
Stanley-Reisner resolution of constant weight linear codes [PDF]
, 2012 Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex.
Johnsen, Trygve, Verdure, Hugues
core +3 more sources
Universal Gr\"obner Bases for Binary Linear Codes [PDF]
, 2013 Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals.
Dück, Natalia, Zimmermann, Karl-Heinz
core +2 more sources
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper, we define linear codes and cyclic codes over a finite Krasner hyperfield and we characterize these codes by their generator matrices and parity check matrices.
Atamewoue Surdive +3 more
doaj +1 more source
Skew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
, 2015 In this article, we study skew cyclic codes over ring $R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and $v^{3}=v$.
Alahmadi, Adel +3 more
core +1 more source
Minimal Codewords in Linear Codes [PDF]
, 2004 2000 Mathematics Subject Classification: 94B05, 94B15.Cyclic binary codes C of block length n = 2^m − 1 and generator polynomial g(x) = m1(x)m2^s+1(x), (s, m) = 1, are considered. The cardinalities of the sets of minimal codewords of weights 10 and 11 in
Borissov, Yuri, Manev, Nickolai
core
Three new classes of optimal frequency-hopping sequence sets
, 2016 The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived two lower bounds
Chen, Bocong +3 more
core +1 more source