Results 51 to 60 of about 858,459 (235)
On the Equivalence of NMDS Codes
An $[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
The equivalence of GRS codes and EGRS codes
Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let $\mathbb{F}_q$ be the $q$ elements finite field, where $q$ is the power of a prime.
openaire +2 more sources
Rapid development of long-span urban transportation hubs arouses higher requirements of structural design methods. However, the current design codes do not give effective provisions of the equivalent uniform live load for long-span transportation hubs. A
Yuhang Li, Yang Deng, Aiqun Li, Peng Sun
doaj +1 more source
Maximum Intersection of Linear Codes and Codes Equivalent to Linear
Summary: We consider linear codes in a space over a finite field with the Hamming metric. A code is called pseudolinear if it is the image of a linear code under an isometric transformation of the space. We derive an upper bound \((q-2)M/q\) attainable for \(q\geqslant 3\) for the size of the intersection of two different pseudolinear codes of the same
Avgustinovich, Sergeĭ Vladimirovich +1 more
openaire +2 more sources
Comparison of numerical codes for coupled thermo-hydro-mechanical simulations of fractured media
Geo-energy and geo-engineering applications, such as improved oil recovery (IOR), geologic carbon storage, and enhanced geothermal systems (EGSs), involve coupled thermo-hydro-mechanical (THM) processes that result from fluid injection and production. In
Ahmad Zareidarmiyan +5 more
doaj +1 more source
QC-LDPC Codes From Difference Matrices and Difference Covering Arrays
We give a framework that generalizes LDPC code constructions using transversal designs or related structures such as mutually orthogonal Latin squares. Our constructions offer a broader range of code lengths and codes rates. Similar earlier constructions
Diane M. Donovan +3 more
doaj +1 more source
Universal topological phase of 2D stabilizer codes
Two topological phases are equivalent if they are connected by a local unitary transformation. In this sense, classifying topological phases amounts to classifying long-range entanglement patterns.
Alicki R +9 more
core +1 more source
Development of International Classification of Diseases crosswalks using text analysis methods.
Objective To evaluate the performance of a natural language processing (NLP) method to develop an automated crosswalk between the 9th and 10th revisions of the International Classification of Diseases (ICD) for diagnosis codes in the Charlson ...
Joykrishna Sarkar, Lisa Lix
doaj +1 more source
Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize 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
Orthogonality for Quantum Latin Isometry Squares [PDF]
Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes.
Benjamin Musto, Jamie Vicary
doaj +1 more source

