Shortened linear code If number of information bits required to encode M messages, the smallest integer l that satisfies inequality , is less than the given code information part length k , then an linear code can be shortened to code, where . This can be done by omitting j information bits. They can be the last (right hand side) information bits: . The generator matrix of such code is obtained by deleting last j rows and columns, the parity-check matrix is obtained by deleting last j columns.
... zobacz całą notatkę