The study delves into the concept of deep holes in linear codes, focusing on twisted Reed-Solomon codes. It explores covering radius, standard deep holes, and complete determinations for various code lengths. The research provides theoretical foundations and practical implications for error distance computation and code optimization. Notable results include character sums, Gauss sums, and polynomial methods to determine deep holes efficiently.
다른 언어로
소스 콘텐츠 기반
arxiv.org
더 깊은 질문