Reed-Solomon codes are usually referred to as (n,k) codes, where n is the total number of symbols in a code block and k is the number of information or data symbols. This core generates systematic code blocks where the complete code block is formed from the k information symbols, followed by the n-k check symbols. The maximum number of errors in a block which can be guaranteed to be corrected is t = (n-k)/2.