 This theorem provides a quick detection criterion and is used in practice to avoid more costly checks, such as those based on matrix ranks.See the reference for implementation details.Information-theoretic achievability proofs result in conditions under which the existence of a well-performing coding scheme is guaranteed.