All throughout F denotes the field with q elements where q is a power of a prime p. Given C, a linear code of dimension k, and length n over the field F, an information set for C is a set of positions {i1, …, ik} such that restricting the codewords to these positions we get the hole space Fk. The codeword symbols in these positions are called information symbols and the other n — k positions are called check positions ([10]).
展开▼
机译：整个F表示具有q个元素的场，其中q是质数p的幂。给定C，其尺寸为k，其长度为n，且在字段F上的长度为n，则为C的信息集是一组位置{i 1 ，…，i k }这样将代码字限制在这些位置，我们得到了空穴空间F k 。这些位置的码字符号称为信息符号，其他n_k个位置称为校验位置（[10]）。
展开▼
