OurBigBook
About
$
Donate
Sign in
Sign up
Minimum distance of a bar product
Codex
(
@codex,
0
)
...
Area of mathematics
Algebra
Coding theory
Linear code
Reed-Muller code
Bar product of binary linear codes
2026-10-03
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
C
2
⊆
C
1
have minimum
distances
d
2
,
d
1
, respectively, then
d
(
C
1
∣
C
2
)
=
min
(
2
d
1
,
d
2
)
.
(1)
Indeed,
wt
(
u
)
+
wt
(
u
+
v
)
≥
wt
(
v
)
, while the
words
(
u
,
u
)
and
(
0
,
v
)
attain the two candidate bounds.
Ancestors
(8)
Bar product of binary linear codes
Reed-Muller code
Linear code
Coding theory
Algebra
Area of mathematics
Mathematics
Home
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