- Source: Linear code
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 partitioned into block codes and convolutional codes, although turbo codes can be seen as a hybrid of these two types. Linear codes allow for more efficient encoding and decoding algorithms than other codes (cf. syndrome decoding).
Linear codes are used in forward error correction and are applied in methods for transmitting symbols (e.g., bits) on a communications channel so that, if errors occur in the communication, some errors can be corrected or detected by the recipient of a message block. The codewords in a linear block code are blocks of symbols that are encoded using more symbols than the original value to be sent. A linear code of length n transmits blocks containing n symbols. For example, the [7,4,3] Hamming code is a linear binary code which represents 4-bit messages using 7-bit codewords. Two distinct codewords differ in at least three bits. As a consequence, up to two errors per codeword can be detected while a single error can be corrected. This code contains 24=16 codewords.
Definition and parameters
A linear code of length n and dimension k is a linear subspace C with dimension k of the vector space
F
q
n
{\displaystyle \mathbb {F} _{q}^{n}}
where
F
q
{\displaystyle \mathbb {F} _{q}}
is the finite field with q elements. Such a code is called a q-ary code. If q = 2 or q = 3, the code is described as a binary code, or a ternary code respectively. The vectors in C are called codewords. The size of a code is the number of codewords and equals qk.
The weight of a codeword is the number of its elements that are nonzero and the distance between two codewords is the Hamming distance between them, that is, the number of elements in which they differ. The distance d of the linear code is the minimum weight of its nonzero codewords, or equivalently, the minimum distance between distinct codewords. A linear code of length n, dimension k, and distance d is called an [n,k,d] code (or, more precisely,
[
n
,
k
,
d
]
q
{\displaystyle [n,k,d]_{q}}
code).
We want to give
F
q
n
{\displaystyle \mathbb {F} _{q}^{n}}
the standard basis because each coordinate represents a "bit" that is transmitted across a "noisy channel" with some small probability of transmission error (a binary symmetric channel). If some other basis is used then this model cannot be used and the Hamming metric does not measure the number of errors in transmission, as we want it to.
Generator and check matrices
As a linear subspace of
F
q
n
{\displaystyle \mathbb {F} _{q}^{n}}
, the entire code C (which may be very large) may be represented as the span of a set of
k
{\displaystyle k}
codewords (known as a basis in linear algebra). These basis codewords are often collated in the rows of a matrix G known as a generating matrix for the code C. When G has the block matrix form
G
=
[
I
k
|
P
]
{\displaystyle {\boldsymbol {G}}=[I_{k}|P]}
, where
I
k
{\displaystyle I_{k}}
denotes the
k
×
k
{\displaystyle k\times k}
identity matrix and P is some
k
×
(
n
−
k
)
{\displaystyle k\times (n-k)}
matrix, then we say G is in standard form.
A matrix H representing a linear function
ϕ
:
F
q
n
→
F
q
n
−
k
{\displaystyle \phi :\mathbb {F} _{q}^{n}\to \mathbb {F} _{q}^{n-k}}
whose kernel is C is called a check matrix of C (or sometimes a parity check matrix). Equivalently, H is a matrix whose null space is C. If C is a code with a generating matrix G in standard form,
G
=
[
I
k
|
P
]
{\displaystyle {\boldsymbol {G}}=[I_{k}|P]}
, then
H
=
[
−
P
T
|
I
n
−
k
]
{\displaystyle {\boldsymbol {H}}=[-P^{T}|I_{n-k}]}
is a check matrix for C. The code generated by H is called the dual code of C. It can be verified that G is a
k
×
n
{\displaystyle k\times n}
matrix, while H is a
(
n
−
k
)
×
n
{\displaystyle (n-k)\times n}
matrix.
Linearity guarantees that the minimum Hamming distance d between a codeword c0 and any of the other codewords c ≠ c0 is independent of c0. This follows from the property that the difference c − c0 of two codewords in C is also a codeword (i.e., an element of the subspace C), and the property that d(c, c0) = d(c − c0, 0). These properties imply that
min
c
∈
C
,
c
≠
c
0
d
(
c
,
c
0
)
=
min
c
∈
C
,
c
≠
c
0
d
(
c
−
c
0
,
0
)
=
min
c
∈
C
,
c
≠
0
d
(
c
,
0
)
=
d
.
{\displaystyle \min _{c\in C,\ c\neq c_{0}}d(c,c_{0})=\min _{c\in C,\ c\neq c_{0}}d(c-c_{0},0)=\min _{c\in C,\ c\neq 0}d(c,0)=d.}
In other words, in order to find out the minimum distance between the codewords of a linear code, one would only need to look at the non-zero codewords. The non-zero codeword with the smallest weight has then the minimum distance to the zero codeword, and hence determines the minimum distance of the code.
The distance d of a linear code C also equals the minimum number of linearly dependent columns of the check matrix H.
Proof: Because
H
⋅
c
T
=
0
{\displaystyle {\boldsymbol {H}}\cdot {\boldsymbol {c}}^{T}={\boldsymbol {0}}}
, which is equivalent to
∑
i
=
1
n
(
c
i
⋅
H
i
)
=
0
{\displaystyle \sum _{i=1}^{n}(c_{i}\cdot {\boldsymbol {H_{i}}})={\boldsymbol {0}}}
, where
H
i
{\displaystyle {\boldsymbol {H_{i}}}}
is the
i
t
h
{\displaystyle i^{th}}
column of
H
{\displaystyle {\boldsymbol {H}}}
. Remove those items with
c
i
=
0
{\displaystyle c_{i}=0}
, those
H
i
{\displaystyle {\boldsymbol {H_{i}}}}
with
c
i
≠
0
{\displaystyle c_{i}\neq 0}
are linearly dependent. Therefore,
d
{\displaystyle d}
is at least the minimum number of linearly dependent columns. On another hand, consider the minimum set of linearly dependent columns
{
H
j
|
j
∈
S
}
{\displaystyle \{{\boldsymbol {H_{j}}}|j\in S\}}
where
S
{\displaystyle S}
is the column index set.
∑
i
=
1
n
(
c
i
⋅
H
i
)
=
∑
j
∈
S
(
c
j
⋅
H
j
)
+
∑
j
∉
S
(
c
j
⋅
H
j
)
=
0
{\displaystyle \sum _{i=1}^{n}(c_{i}\cdot {\boldsymbol {H_{i}}})=\sum _{j\in S}(c_{j}\cdot {\boldsymbol {H_{j}}})+\sum _{j\notin S}(c_{j}\cdot {\boldsymbol {H_{j}}})={\boldsymbol {0}}}
. Now consider the vector
c
′
{\displaystyle {\boldsymbol {c'}}}
such that
c
j
′
=
0
{\displaystyle c_{j}'=0}
if
j
∉
S
{\displaystyle j\notin S}
. Note
c
′
∈
C
{\displaystyle {\boldsymbol {c'}}\in C}
because
H
⋅
c
′
T
=
0
{\displaystyle {\boldsymbol {H}}\cdot {\boldsymbol {c'}}^{T}={\boldsymbol {0}}}
. Therefore, we have
d
≤
w
t
(
c
′
)
{\displaystyle d\leq wt({\boldsymbol {c'}})}
, which is the minimum number of linearly dependent columns in
H
{\displaystyle {\boldsymbol {H}}}
. The claimed property is therefore proven.
Example: Hamming codes
As the first class of linear codes developed for error correction purpose, Hamming codes have been widely used in digital communication systems. For any positive integer
r
≥
2
{\displaystyle r\geq 2}
, there exists a
[
2
r
−
1
,
2
r
−
r
−
1
,
3
]
2
{\displaystyle [2^{r}-1,2^{r}-r-1,3]_{2}}
Hamming code. Since
d
=
3
{\displaystyle d=3}
, this Hamming code can correct a 1-bit error.
Example : The linear block code with the following generator matrix and parity check matrix is a
[
7
,
4
,
3
]
2
{\displaystyle [7,4,3]_{2}}
Hamming code.
G
=
(
1
0
0
0
1
1
0
0
1
0
0
0
1
1
0
0
1
0
1
1
1
0
0
0
1
1
0
1
)
,
{\displaystyle {\boldsymbol {G}}={\begin{pmatrix}1\ 0\ 0\ 0\ 1\ 1\ 0\\0\ 1\ 0\ 0\ 0\ 1\ 1\\0\ 0\ 1\ 0\ 1\ 1\ 1\\0\ 0\ 0\ 1\ 1\ 0\ 1\end{pmatrix}},}
H
=
(
1
0
1
1
1
0
0
1
1
1
0
0
1
0
0
1
1
1
0
0
1
)
{\displaystyle {\boldsymbol {H}}={\begin{pmatrix}1\ 0\ 1\ 1\ 1\ 0\ 0\\1\ 1\ 1\ 0\ 0\ 1\ 0\\0\ 1\ 1\ 1\ 0\ 0\ 1\end{pmatrix}}}
Example: Hadamard codes
Hadamard code is a
[
2
r
,
r
,
2
r
−
1
]
2
{\displaystyle [2^{r},r,2^{r-1}]_{2}}
linear code and is capable of correcting many errors. Hadamard code could be constructed column by column : the
i
t
h
{\displaystyle i^{th}}
column is the bits of the binary representation of integer
i
{\displaystyle i}
, as shown in the following example. Hadamard code has minimum distance
2
r
−
1
{\displaystyle 2^{r-1}}
and therefore can correct
2
r
−
2
−
1
{\displaystyle 2^{r-2}-1}
errors.
Example: The linear block code with the following generator matrix is a
[
8
,
3
,
4
]
2
{\displaystyle [8,3,4]_{2}}
Hadamard code:
G
H
a
d
=
(
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
)
{\displaystyle {\boldsymbol {G}}_{Had}={\begin{pmatrix}0\ 0\ 0\ 0\ 1\ 1\ 1\ 1\\0\ 0\ 1\ 1\ 0\ 0\ 1\ 1\\0\ 1\ 0\ 1\ 0\ 1\ 0\ 1\end{pmatrix}}}
.
Hadamard code is a special case of Reed–Muller code. If we take the first column (the all-zero column) out from
G
H
a
d
{\displaystyle {\boldsymbol {G}}_{Had}}
, we get
[
7
,
3
,
4
]
2
{\displaystyle [7,3,4]_{2}}
simplex code, which is the dual code of Hamming code.
Nearest neighbor algorithm
The parameter d is closely related to the error correcting ability of the code. The following construction/algorithm illustrates this (called the nearest neighbor decoding algorithm):
Input: A received vector v in
F
q
n
{\displaystyle \mathbb {F} _{q}^{n}}
.
Output: A codeword
w
{\displaystyle w}
in
C
{\displaystyle C}
closest to
v
{\displaystyle v}
, if any.
Starting with
t
=
0
{\displaystyle t=0}
, repeat the following two steps.
Enumerate the elements of the ball of (Hamming) radius
t
{\displaystyle t}
around the received word
v
{\displaystyle v}
, denoted
B
t
(
v
)
{\displaystyle B_{t}(v)}
.
For each
w
{\displaystyle w}
in
B
t
(
v
)
{\displaystyle B_{t}(v)}
, check if
w
{\displaystyle w}
in
C
{\displaystyle C}
. If so, return
w
{\displaystyle w}
as the solution.
Increment
t
{\displaystyle t}
. Fail only when
t
>
(
d
−
1
)
/
2
{\displaystyle t>(d-1)/2}
so enumeration is complete and no solution has been found.
We say that a linear
C
{\displaystyle C}
is
t
{\displaystyle t}
-error correcting if there is at most one codeword in
B
t
(
v
)
{\displaystyle B_{t}(v)}
, for each
v
{\displaystyle v}
in
F
q
n
{\displaystyle \mathbb {F} _{q}^{n}}
.
Popular notation
Codes in general are often denoted by the letter C, and a code of length n and of rank k (i.e., having n code words in its basis and k rows in its generating matrix) is generally referred to as an (n, k) code. Linear block codes are frequently denoted as [n, k, d] codes, where d refers to the code's minimum Hamming distance between any two code words.
(The [n, k, d] notation should not be confused with the (n, M, d) notation used to denote a non-linear code of length n, size M (i.e., having M code words), and minimum Hamming distance d.)
Singleton bound
Lemma (Singleton bound): Every linear [n,k,d] code C satisfies
k
+
d
≤
n
+
1
{\displaystyle k+d\leq n+1}
.
A code C whose parameters satisfy k+d=n+1 is called maximum distance separable or MDS. Such codes, when they exist, are in some sense best possible.
If C1 and C2 are two codes of length n and if there is a permutation p in the symmetric group Sn for which (c1,...,cn) in C1 if and only if (cp(1),...,cp(n)) in C2, then we say C1 and C2 are permutation equivalent. In more generality, if there is an
n
×
n
{\displaystyle n\times n}
monomial matrix
M
:
F
q
n
→
F
q
n
{\displaystyle M\colon \mathbb {F} _{q}^{n}\to \mathbb {F} _{q}^{n}}
which sends C1 isomorphically to C2 then we say C1 and C2 are equivalent.
Lemma: Any linear code is permutation equivalent to a code which is in standard form.
Bonisoli's theorem
A code is defined to be equidistant if and only if there exists some constant d such that the distance between any two of the code's distinct codewords is equal to d. In 1984 Arrigo Bonisoli determined the structure of linear one-weight codes over finite fields and proved that every equidistant linear code is a sequence of dual Hamming codes.
Examples
Some examples of linear codes include:
Generalization
Hamming spaces over non-field alphabets have also been considered, especially over finite rings, most notably Galois rings over Z4. This gives rise to modules instead of vector spaces and ring-linear codes (identified with submodules) instead of linear codes. The typical metric used in this case the Lee distance. There exist a Gray isometry between
Z
2
2
m
{\displaystyle \mathbb {Z} _{2}^{2m}}
(i.e. GF(22m)) with the Hamming distance and
Z
4
m
{\displaystyle \mathbb {Z} _{4}^{m}}
(also denoted as GR(4,m)) with the Lee distance; its main attraction is that it establishes a correspondence between some "good" codes that are not linear over
Z
2
2
m
{\displaystyle \mathbb {Z} _{2}^{2m}}
as images of ring-linear codes from
Z
4
m
{\displaystyle \mathbb {Z} _{4}^{m}}
.
Some authors have referred to such codes over rings simply as linear codes as well.
See also
Decoding methods
References
= Bibliography
=J. F. Humphreys; M. Y. Prest (2004). Numbers, Groups and Codes (2nd ed.). Cambridge University Press. ISBN 978-0-511-19420-7. Chapter 5 contains a more gentle introduction (than this article) to the subject of linear codes.
External links
q-ary code generator program
Code Tables: Bounds on the parameters of various types of codes, IAKS, Fakultät für Informatik, Universität Karlsruhe (TH)]. Online, up to date table of the optimal binary codes, includes non-binary codes.
The database of Z4 codes Online, up to date database of optimal Z4 codes.
Kata Kunci Pencarian:
- Metode linear kongruen
- Linear B Ideograms
- Linear Elam
- Linear A (blok Unicode)
- Kode Morse
- Silabis Linear B
- Kode batang
- Metode simpleks
- Alice Kober
- Modulasi kode pulsa
- Linear code
- Linear predictive coding
- Barcode
- Pulse-code modulation
- Linear network coding
- Gilbert–Varshamov bound for linear codes
- Code-excited linear prediction
- Hamming code
- Linear code sequence and jump
- Linear A
