Results 41 to 50 of about 4,907,516 (322)
ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH
, 2022 The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.
Iliya Bouyukliev, Stefka Bouyuklieva
openaire +2 more sources
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography [PDF]
IEEE Transactions on Information Theory, 2019 We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we propose an efficient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical LDPC codes for the rank metric.
Nicolas Aragon +4 more
semanticscholar +1 more source
Avoiding coherent errors with rotated concatenated stabilizer codes
npj Quantum Information, 2021 Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors.
Yingkai Ouyang
doaj +1 more source
Equivalent-Capacity-Based Design of Space-Time Block-Coded Sphere-Packing-Aided Multilevel Coding [PDF]
, 2007 A multilevel coding (MLC) scheme invoking sphere packing (SP) modulation combined with space time block coding (STBC) is designed. The coding rates of each of the MLC component codes are determined using the so-called equivalent capacity based ...
Alamri, O. +3 more
core +1 more source
Report on Existing Fireproof Construction Guidelines for Dwellings against Wildfires
CivilEng, 2023 This work presents a state-of-the-art review of existing fireproof construction guidelines for dwellings against wildfires. The most important wildfire-proof construction guidelines and codes for dwellings are presented, and these are later associated ...
Pedro Cantor +4 more
doaj +1 more source
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
, 2017 It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound.
Jin, Lingfei, Xing, Chaoping
core +1 more source
Locally Testable Codes and Cayley Graphs [PDF]
, 2013 We give two new characterizations of ($\F_2$-linear) locally testable error-correcting codes in terms of Cayley graphs over $\F_2^h$: \begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of generators ...
Ben-Sasson Eli +5 more
core +1 more source
MRD-codes arising from the trinomial xq+xq3+cxq5⊕Fq6[x] [PDF]
Linear Algebra and its Applications, 2019 In [10], the existence of $\mathbb{F}_q$-linear MRD-codes of $\mathbb{F}_q^{6\times 6}$, with dimension $12$, minimum distance $5$ and left idealiser isomorphic to $\mathbb{F}_{q^6}$, defined by a trinomial of $\mathbb{F}_{q^6}[x]$, when $q$ is odd and ...
G. Marino +2 more
semanticscholar +1 more source
On the Equivalence of NMDS Codes
IEEE Transactions on Information TheoryAn $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum distance separable (NMDS).
Jianbing Lu, Yue Zhou
openaire +2 more sources
, 2005 We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12.
A. Bouchet +10 more
core +1 more source