In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally...

linear network coding is a program in which intermediate nodes transmit data from source nodes to sink nodes by means of linear combinations. Linear network...

described both the linear and bull's eye printing patterns, as well as the mechanical and electronic systems needed to read the code. The patent was issued...

with its invention. Linear pulse-code modulation (LPCM) is a specific type of PCM in which the quantization levels are linearly uniform. This is in contrast...

computer science and telecommunications, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors, or...

Linear code sequence and jump (LCSAJ), in the broad sense, is a software analysis method used to identify structural units in code under test. Its primary...

The Gilbert–Varshamov bound for linear codes is related to the general Gilbert–Varshamov bound, which gives a lower bound on the maximal number of elements...

Code-excited linear prediction (CELP) is a linear predictive speech coding algorithm originally proposed by Manfred R. Schroeder and Bishnu S. Atal in...

the code. There are many types of linear block codes, such as Cyclic codes (e.g., Hamming codes) Repetition codes Parity codes Polynomial codes (e.g...

Linear predictive coding (LPC) is a method used mostly in audio signal processing and speech processing for representing the spectral envelope of a digital...

Gilbert–Varshamov bound for linear codes over general fields. In 2003, an irregular repeat accumulate (IRA) style LDPC code beat six turbo codes to become the error-correcting...

In coding theory, the dual code of a linear code C ⊂ F q n {\displaystyle C\subset \mathbb {F} _{q}^{n}} is the linear code defined by C ⊥ = { x ∈ F q...

mathematician Joseph Leonard Walsh. The Hadamard code is an example of a linear code of length 2 m {\displaystyle 2^{m}} over a binary alphabet. Unfortunately...

codes, Hadamard codes, Expander codes, Golay codes, Reed–Muller codes and Polar codes. These examples also belong to the class of linear codes, and hence they...

PVC. There are further coverage criteria, which are used less often: Linear Code Sequence and Jump (LCSAJ) coverage a.k.a. JJ-Path coverage – has every...

Algebraic code-excited linear prediction (ACELP) is a speech coding algorithm in which a limited set of pulses is distributed as excitation to a linear prediction...

remote site at a later time. Every non-systematic linear code can be transformed into a systematic code with essentially the same properties (i.e., minimum...

Algebraic geometry codes, often abbreviated AG codes, are a type of linear code that generalize Reed–Solomon codes. The Russian mathematician V. D. Goppa...

&g_{k,n}\end{bmatrix}}} The Reed–Solomon code is a [n, k, n − k + 1] code; in other words, it is a linear block code of length n (over F) with dimension k...

In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length)...

In coding theory, a generator matrix is a matrix whose rows form a basis for a linear code. The codewords are all of the linear combinations of the rows...

linear code encryption scheme RLCE which is based on McEliece schemes. RLCE scheme can be constructed using any linear code such as Reed-Solomon code...

In coding theory, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight. Let C ⊂ F 2...

coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert and independently Rom Varshamov) is a bound on the size of a (not necessarily linear)...

(1953). Linear block codes that achieve equality in the Singleton bound are called MDS (maximum distance separable) codes. Examples of such codes include...

Golay code is a type of linear error-correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a...

Recoverable Codes Burst error-correcting code Code rate Erasure codes Error detection and correction Error-correcting codes with feedback Linear code Quantum...

A Sparse graph code is a code which is represented by a sparse graph. Any linear code can be represented as a graph, where there are two sets of nodes...

contains Linear A Unicode characters. Without proper rendering support, you may see question marks, boxes, or other symbols instead of Linear A. Linear A is...

In coding theory, rank codes (also called Gabidulin codes) are non-binary linear error-correcting codes over not Hamming but rank metric. They described...