Results 1 to 10 of about 7,931,944 (349)
A consensus-based and readable extension of Linear Code for Reaction Rules (LiCoRR) [PDF]
Systems glycobiology aims to provide models and analysis tools that account for the biosynthesis, regulation, and interactions with glycoconjugates.
Benjamin P. Kellman +19 more
doaj +4 more sources
The Extended Codes of Some Linear Codes [PDF]
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended code of $\C ...
Zhonghua Sun, C. Ding, Ting Chen
semanticscholar +4 more sources
On the Covering Dimension of a Linear Code [PDF]
This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid and, thus, generalizes invariants that lie at the heart of several fundamental problems in a coding ...
Thomas Britz, Keisuke Shiromoto
semanticscholar +5 more sources
An Extension of the Brouwer–Zimmermann Algorithm for Calculating the Minimum Weight of a Linear Code
A modification of the Brouwer–Zimmermann algorithm for calculating the minimum weight of a linear code over a finite field is presented. The aim was to reduce the number of codewords for consideration.
Stefka Bouyuklieva, Iliya Bouyukliev
doaj +3 more sources
An Efficient Decoder for a Linear Distance Quantum LDPC Code [PDF]
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes.
Shouzhen Gu, C. Pattison, Eugene Tang
semanticscholar +1 more source
Triangular code: Near-optimal linear time fountain code
In this paper, we propose Triangular Code (TC), a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of O(Lklogk), where k is the packet batch size and L is the packet data length.
Jalaluddin Qureshi, Chuan Heng Foh
doaj +1 more source
Linear Computation Coding [PDF]
We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear functions, we present an algorithm to reduce the computational cost of multiplying an arbitrary given matrix with an ...
Ralf R. Müller +2 more
openaire +2 more sources
Error correction by Reed–Solomon codes using its automorphisms
The article explores the syndrome invariants of АГ-group of automorphisms of Reed–Solomon codes (RS-codes) that are a joint group of affine and cyclic permutations. The found real invariants are a set of norms of N Г-orbits that make up one or another АГ-
V. A. Lipnitsky, S. I. Semyonov
doaj +1 more source
The JOREK non-linear extended MHD code and applications to large-scale instabilities and their control in magnetically confined fusion plasmas [PDF]
JOREK is a massively parallel fully implicit non-linear extended magneto-hydrodynamic (MHD) code for realistic tokamak X-point plasmas. It has become a widely used versatile simulation code for studying large-scale plasma instabilities and their control ...
M. Hoelzl +52 more
semanticscholar +1 more source
Large scale and linear scaling DFT with the CONQUEST code. [PDF]
We survey the underlying theory behind the large-scale and linear scaling density functional theory code, conquest, which shows excellent parallel scaling and can be applied to thousands of atoms with diagonalization and millions of atoms with linear ...
A. Nakata +10 more
semanticscholar +1 more source

