The decoding error occurs where there are more than 1 bits that are flipped. Hence, if the probability that a bit is flip is $10\%$, then shouldn't the decoding error percentage be $1-0.1\cdot0.9^6\cdot7-0.9^7 = 0.149$? Why my textbook (by MacKay) claims that it is $7\%$?
2026-03-29 04:09:48.1774757388
What is the decoding error percentage of (7,4) Hamming code?
1.7k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in CODING-THEORY
- Solving overdetermined linear systems in GF(2)
- Inverting a generator matrix - Coding Theory
- Probability of a block error of the (N, K) Hamming code used for a binary symmetric channel.
- How to decode a Hadamard message that was encoded using the inner product method?
- How to decode a Hadamard message that was encoded using a generator matrix?
- Find the two missing digits in 10-ISBN code
- Characterize ideals in $\mathbb{F}_l[x]/(x-1) \oplus \mathbb{F}_l[x]/(\frac{x^p-1}{x-1})$
- Number of codes with max codeword length over an alphabet
- Dimension of ASCII code
- Prove how many errors CRC code can detect
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Let $E$ denote the event that the output of the decoder is a codeword that is not the same as the transmitted codeword, and let $E_i$ denote the event that the $i$-th data bit in the output codeword differs from the $i$-th data bit of the transmitted codeword. Clearly we have that $$E = E_1 \cup E_2 \cup \cdots \cup E_k.\tag{1}$$ since if none of the $E_i$ occur, then the data bits in the output codeword are all correct and so the output codeword must be the same as the transmitted codeword.
Now, in general, the events $E_i$ are neither independent events nor equiprobable events. The Bit Error Rate (BER) for the decoded data bits, denoted by $P_b$ here, is defined as the arithmetic average of the $k$ $P(E_i)$ values. It is generally quite time-consuming to determine the values of the $P(E_i)$ or their average $P_b$ except for codes of very short blocklengths, whereas $P(E)$, the probability that the decoder output is not the same as the transmitted codeword, is easier to determine (or overbound for bounded-distance decoders that are prone to decoder failure). It is straightforward to show that $$\frac 1k P(E) \leq P_b \leq P(E)\tag{2}$$ which in the instance that is puzzling the OP tells us that the BER must be between $3.725\%$ and $14.9\%$. More can be said in this particular case, however, the codewords of a $[7,4]$ Hamming code are very closely related to what is called a biorthogonal signal set in the communications literature (the codewords of the $[8,4]$ extended Hamming code are exactly a biorthogonal signal set). For a biorthogonal signal set, the BER is very nearly $\frac 12P(E)$, and so the $7\%$ BER claimed in the Mackay text can be explained as being consistent with this result, with some differences because the $[7,4]$ Hamming code is not quite a biorthogonal signal set, and because $P_b$ is not exactly $\frac 12 P(E)$ for a biorthogonal signal set.
Masochists who really want to delve into the details can find information about orthogonal and biorthogonal signal sets and their relationship to first-order Reed-Muller codes (of which class the $[8,4]$ extended Hamming code is an example) can find some basic information on pp. 161-180 of this ancient Lecture Note of mine.