A (105,10,47) binary quasi-cyclic code

Brouwer, 1993, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inf. Theory, IT-39, 662, 10.1109/18.212301 MacWilliams, 1977 Townsend, 1967, Self-orthogonal quasi-cyclic codes, IEEE Trans. Inf. Theory, IT-13, 183, 10.1109/TIT.1967.1053974 Karlin, 1969, New binary coding results by circulants, IEEE Trans. Inf. Theory, IT-15, 81, 10.1109/TIT.1969.1054261 Karlin, 1970, Decoding of circulant codes, IEEE Trans. Inf. Theory, IT-16, 797, 10.1109/TIT.1970.1054538 Chen, 1969, Some results on quasi-cyclic codes, Inf. and Contr., 407, 10.1016/S0019-9958(69)90497-5 Gulliver, 1991, Some best rate 1p and rate (p−1)p systematic quasi-cyclic codes, IEEE Trans. Inf. Theory, IT-37, 552, 10.1109/18.79911 Gulliver, 1992, Nine good rate (m − 1)pm quasi-cyclic codes, IEEE Trans. Inf. Theory, IT-38, 1366, 10.1109/18.144718 Gulliver, 1993, Twelve good rate (m − r)pm quasi-cyclic codes, IEEE Trans. Inf. Theory, IT-39, 10.1109/ISIT.1993.748615 Weldon, 1970, Long quasi-cyclic codes are good, IEEE Trans. Inf. Theory, IT-13, 130 Kasami, 1974, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 12, IEEE Trans. Inf. Theory, IT-20, 679, 10.1109/TIT.1974.1055262 Gulliver, 1993, A systematic (16,8) code for correcting double errors and detecting triple-adjacent errors, IEEE Trans. Computers, 42, 109, 10.1109/12.192220 Solomon, 1979, A connection between block codes and convolutional codes, SIAM J. Appl. Math., 37, 358, 10.1137/0137027 Wang, 1989, Construction of optimal quasi-cyclic codes based on optimum distance profile convolutional codes, Archiv für Elektronik und Übertragungstechnik, 43, 62