Results 61 to 70 of about 858,459 (235)
, 2019 We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant dimension subspace ...
Cossidente, Antonio +2 more
core +1 more source
Characters and the equivalence of codes
Journal of Combinatorial Theory, Series A, 1996 Let \(K\) be a finite field. A linear code of dimension \(k\) and block length \(n\) is a \(k\)-dimensional \(K\)-linear subspace \(C\) of the \(n\)-dimensional vector space \(K^n\) over \(K\). Two linear codes \(C_1\) and \(C_2\) in \(K^n\) are equivalent if there exists a monomial transformation \(T: K^n\to K^n\) such that \(T(C_1)= C_2 ...
Ward, Harold N., Wood, Jay A.
openaire +3 more sources
Computer-based analysis of spatial frames according to second order theory
Građevinar, 2016 The analysis of spatial frames formed of beam elements according to the second order theory is presented in the paper. The stiffness matrix and equivalent load vector elements are derived from the exact solution of the corresponding differential ...
Ljiljana Žugić +2 more
doaj +1 more source
Cyclic Low-Density MDS Array Codes [PDF]
, 2006 We construct two infinite families of low density MDS array codes which are also cyclic. One of these families includes the first such sub-family with redundancy parameter r > 2.
Jehoshua Bruck +3 more
core +2 more sources
Code diversity in multiple antenna wireless communication
, 2008 The standard approach to the design of individual space-time codes is based on optimizing diversity and coding gains. This geometric approach leads to remarkable examples, such as perfect space-time block codes, for which the complexity of Maximum ...
Calderbank, Robert, Wu, Yiyue
core +1 more source
Cyclic LRC Codes and their Subfield Subcodes
, 2015 We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.
Barg, Alexander +3 more
core +1 more source
Minimum Description Length Codes Are Critical
Entropy, 2018 In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL are critical in a very precise sense.
Ryan John Cubero +2 more
doaj +1 more source
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
, 2017 Reed-Muller codes are some of the oldest and most widely studied error-correcting codes, of interest for both their algebraic structure as well as their many algorithmic properties.
Kopparty, Swastik, Potukuchi, Aditya
core +1 more source
, 2021 When discussing equivalent codes, the literature tends to define equivalence differently for linear or nonlinear codes. For non-linear codes, one normally defines equivalence based on a permutation of coordinates and permutations of the code alphabet on each coordinate.
openaire +1 more source
Local invariants of stabilizer codes
, 2004 In [Phys. Rev. A 58, 1833 (1998)] a family of polynomial invariants which separate the orbits of multi-qubit density operators $\rho$ under the action of the local unitary group was presented. We consider this family of invariants for the class of those $
A. L. Onishchik +5 more
core +1 more source