Abstract
Conflict-avoiding codes (CACs) have played an important role in multiple-access collision channel without feedback. The size of a CAC is the number of codewords which equals the number of potential users that can be supported in the system. A CAC with maximal code size is said to be optimal. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the maximal sizes of both equidifference and non equidifference CACs of odd prime length and weight 3 are obtained. Meanwhile, the optimal constructions of both equidifference and non equidifference CACs are presented. The numbers of equidifference and non equidifference codewords in an optimal code are also obtained. Furthermore, a new modified recursive construction of CACs for any odd length is shown. Non equidifference codes can be constructed in this method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bassalygo L.A., Pinsker M.S.: Limited multiple-access of a nonsynchronous channel (in Russian). Probl. Inf. Transm. 19, 92–96 (1983).
Fu H.L., Li Y.H., Mishima M.: Optimal conflict avoiding codes of even length and weight 3. IEEE Trans. Inf. Theory 56, 5747–5756 (2010).
Gryorfi N.Q.A.L., Massey J.L.: Constructions of binary constant weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38, 940–949 (1992).
Györfil V.I.: Constructions of protocol sequences for multiple access collision channel without feedback. IEEE Trans. Inf. Theory 39, 1762–1765 (1993).
Jimbo M., Mishima M., Janiszewski S., Teymorian A.Y., Tonchev V.D.: On conflict avoiding codes of length n=4m for three active users. IEEE Trans. Inf. Theory 53, 2732–2742 (2007).
Levenshtein V.I., Tonchev V.D.: Optimal conflict-avoiding codes for three active users. In: Proceedings of the IEEE International Symposium on Information Theory, Adelaide 4–9 Sept, 535–537 (2005).
Levenshtein V.I.: Conflict-avoiding codes for three active users and cyclic triple systems. Probl. Inf. Transm. 43, 199–212 (2007).
Massey J.L., Mathys P.: The collision channel without feedback. IEEE Trans. Inf. Theory 31, 192–204 (1985).
Mathys P.: A class of codes for a T active users out of N multiple-access communication system. IEEE Trans. Inf. Theory 36, 1206–1219 (1990).
Mishima M., Fu H.L., Uruno S.: Optimal conflict avoiding codes of length n=(0 mod16) and weight 3. Des. Codes Cryptogr. 52, 275–291 (2009).
Momihara K., Muller M., Satoh J., Jimbo M.: Constant weight conflict avoiding codes. SIAM J. Discret. Math. 21, 959–979 (2007).
Momihara K.: Necessary and sufficient conditions for tight equidifference conflict avoiding codes of weight three. Des. Codes Cryptogr. 45, 379–390 (2007).
Shum K.W., Wong W.S., Chen C.S.: A general upper bound on the size of constant weight conflict avoiding codes. IEEE Trans. Inf. Theory 56, 3265–3276 (2010).
Tsybakov B.S., Rubinov A.R.: Some constructions of conflict-avoiding codes. Probl. Inf. Transm. 38, 268–279 (2002).
Acknowledgments
This study was supported by National Science Foundation of China under Grant No. 61072140, the 111 project under grant No. B08038, and the Specialized Research Fund for the Doctoral Program of Higher Education under grant No. 20100203110003.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. A. Zinoviev.
Rights and permissions
About this article
Cite this article
Ma, W., Zhao, Ce. & Shen, D. New optimal constructions of conflict-avoiding codes of odd length and weight 3. Des. Codes Cryptogr. 73, 791–804 (2014). https://doi.org/10.1007/s10623-013-9827-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-013-9827-2