OurBigBook
About
$
Donate
Sign in
Sign up
Minimum Hamming distance of a linear code
(
d
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Algebra
Coding theory
Linear code
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The minimum
Hamming distance
of
a
nonzero
linear code
is the smallest
Hamming weight
of
a
nonzero codeword.
Ancestors
(6)
Linear code
Coding theory
Algebra
Area of mathematics
Mathematics
Home
Incoming links
(7)
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 33
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 87
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2006
/
iii
/
Paper 30
/
4
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2015
/
ii
/
Paper 4
/
3G
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2019
/
ii
/
Paper 2
/
3G
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2020
/
ii
/
Paper 2
/
12I
/
iii
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ii
/
Paper 3
/
3I
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version