In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base $2$ expansion of the integers in their defining set. In this paper we propose an analogue for quaternary codes. In addition, the performances of the subfield subcode and of the trace code (two binary cyclic codes) are investigated.

翻译：在近期的一篇论文中，Tang和Ding引入了一类二元循环码，其码率接近二分之一，并带有最小距离的设计下界。该定义涉及定义集中整数的基2展开。本文提出了一种四元码的模拟方案。此外，还研究了子域子码和迹码（两种二元循环码）的性能。