There is more than one upper bound on the achievable code rate of linear block codes for multiple phased-burst correction ( MPBC ).
32.
For block codes with messages of length k over an alphabet of size q, this number would be M = q ^ k.
33.
The codewords in a linear block code are blocks of symbols that are encoded using more symbols than the original value to be sent.
34.
There are block codes that are not linear, but it is difficult to prove that a code is a good one without this property.
35.
In contrast to classical block codes that often specify an error-detecting or error-correcting ability, many modern block codes such as LDPC codes lack such guarantees.
36.
MDS codes are an important class of block codes since, for a fixed n and k, they have the greatest error correcting and detecting capabilities.
37.
If \ ell is the burst error correcting ability of an ( n, k ) linear block code, then 2 \ ell \ leqslant n-k.
38.
In contrast to classical block codes that often specify an error-detecting or error-correcting ability, many modern block codes such as LDPC codes lack such guarantees.
39.
Sometimes, especially for non-block codes, the notation ( n, M, d ) _ q is used for codes that contain M codewords of length n.
40.
Delaware uses a single letter code for counties and adds a block code ( A-K ) within each county, with sequential numbers for each block.
