Results 51 to 60 of about 4,907,516 (322)
Linear Algebra and its ApplicationsGiven a finite field F_q and a positive integer n, a flag is a sequence of nested F_q-subspaces of a vector space F_q^n and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes containing all the subspaces of prescribed dimensions that form the flags in the flag code.
Miguel Ángel Navarro-Pérez +1 more
openaire +4 more sources
On the equivalence of linear cyclic and constacyclic codes
Discrete Mathematics, 2023 We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over finite fields.
Reza Dastbasteh, Petr Lisonek
openaire +3 more sources
Codes Correcting a Burst of Deletions or Insertions [PDF]
IEEE Transactions on Information Theory, 2016 This paper studies codes that correct a burst of deletions or insertions. Namely, a code will be called a $b$ -burst-deletion/insertion-correcting code if it can correct a burst of deletions/insertions of any $b$ consecutive bits.
Clayton Schoeny +3 more
semanticscholar +1 more source
Stabilizer Codes with Exotic Local-dimensions [PDF]
QuantumTraditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases.
Lane G. Gunderman
doaj +1 more source
Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
Physical Review Research, 2020 Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed. These states are relevant for our understanding of multipartite entanglement, quantum information protocols, and ...
Zahra Raissi +3 more
doaj +1 more source
Neural networks, error-correcting codes, and polynomials over the binary n-cube [PDF]
, 1989 Several ways of relating the concept of error-correcting codes to the concept of neural networks are presented. Performing maximum-likelihood decoding in a linear block error-correcting code is shown to be equivalent to finding a global maximum of the ...
Blaum, Mario, Bruck, Jehoshua
core +1 more source
General Linearized Polynomial Interpolation and Its Applications
, 2011 In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes.
Suter, Bruce W. +2 more
core +1 more source
Optimization-Based Linear Network Coding for General Connections of Continuous Flows [PDF]
, 2015 For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of network codes in
Cui, Ying +4 more
core +3 more sources
On the computational hardness of the code equivalence problem in cryptography
Advances in Mathematics of Communications, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alessandro Barenghi +3 more
openaire +5 more sources
Convolutional-Code-Specific CRC Code Design
, 2015 Cyclic redundancy check (CRC) codes check if a codeword is correctly received. This paper presents an algorithm to design CRC codes that are optimized for the code-specific error behavior of a specified feedforward convolutional code.
Daneshrad, Babak +2 more
core +1 more source