Author: Stan Eisenstat
Subject: Re: [Cs323] Hamming Codes
Date: Monday, 12 Oct 2020, 19:10:49
> Message Posted By: Unknown
>
> Are Hamming Codes (at least the scheme we discussed in class) optimal to
> satisfy SECDED in the sense that they require the fewest total parity bits
> for large amounts of data bits?
The Hamming code without the overall parity bit is
optimal when the number N of data bits and the number
K of parity bits satisfy N = 2^K - K - 1. I do not know
if it is still optimal without these restrictions.
--Stan-
PREV
INDEX
NEXT