OurBigBook
About
$
Donate
Sign in
Sign up
Weakly symmetric channel capacity
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Probability and statistics
Information theory
Channel capacity
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If every row of an
m
-output channel
matrix
is
a
permutation
of every other row and all column
sums
agree, the uniform input achieves
a
uniform output and
C
=
lo
g
2
m
−
H
(
one row
)
.
(1)
Table of contents
Binary symmetric channel capacity
Weakly symmetric channel capacity
Ternary symmetric channel capacity
Weakly symmetric channel capacity
Binary symmetric channel capacity
0
0
0
Weakly symmetric channel capacity
A
binary symmetric channel
with crossover
probability
p
has capacity
C
=
1
−
h
2
(
p
)
(1)
bits
per
channel use
.
Ternary symmetric channel capacity
0
0
0
Weakly symmetric channel capacity
For
diagonal
transition
probability
1
−
2
α
and each off-
diagonal
probability
α
,
C
=
lo
g
2
3
+
(
1
−
2
α
)
lo
g
2
(
1
−
2
α
)
+
2
α
lo
g
2
α
,
(1)
with
0
lo
g
0
=
0
.
Ancestors
(6)
Channel capacity
Information theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 37
/
4
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2014
/
iii
/
Paper 60
/
2
/
i
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ii
/
Paper 1
/
11I
/
c
/
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