1. bookTom 18 (2018): Zeszyt 5 (May 2018)
    Special Thematic Zeszyt on Optimal Codes and Related Topics
Informacje o czasopiśmie
License
Format
Czasopismo
eISSN
1314-4081
Pierwsze wydanie
13 Mar 2012
Częstotliwość wydawania
4 razy w roku
Języki
Angielski
Otwarty dostęp

New Results on Binary Codes Obtained by Doubling Construction

Data publikacji: 26 May 2018
Tom & Zeszyt: Tom 18 (2018) - Zeszyt 5 (May 2018) - Special Thematic Zeszyt on Optimal Codes and Related Topics
Zakres stron: 63 - 76
Otrzymano: 30 Sep 2017
Przyjęty: 08 Dec 2017
Informacje o czasopiśmie
License
Format
Czasopismo
eISSN
1314-4081
Pierwsze wydanie
13 Mar 2012
Częstotliwość wydawania
4 razy w roku
Języki
Angielski

1. Afanassiev, V. B., A. A. Davydov. Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4. − In: Proc. of IEEE Int. Symp. Inform. Theory (ISIT’17), Aachen, Germany, 2017, pp. 2193-2197. http://ieeexplore.ieee.org/document/8006918/10.1109/ISIT.2017.8006918Search in Google Scholar

2. Afanassiev, V. B., A. A. Davydov, D. K. Zigangirov. Design and Analysis of Codes with Distance 4 and 6 Minimizing the Probability of Decoder Error. − J. Communic. Technology Electronics, Vol. 61, 2016, No 12, pp. 1440-1455.10.1134/S1064226916120020Search in Google Scholar

3. Baicheva, T., S. Dodunekov, P. Kazakov. On the Undetected Error Probability Performance of Cyclic Redundancy-Check Codes of 16-bit Redundancy. − IEEE Trans. Comm., Vol. 147, 2000, No 5, pp. 253-256.10.1049/ip-com:20000649Search in Google Scholar

4. Bartoli, D., S. Marcugini, F. Pambianco. A Computer Based Classification of Caps in PG(5, 2). arXiv:1203.0994 [math.CO], 2012.Search in Google Scholar

5. Davydov, A. A., S. Marcugini, F. Pambianco. Further Results on Binary Codes Obtained by Doubling Construction. − In: Proc. Eighth International Workshop on Optimal Codes and Related Topics, OC’17 (in Second International Conference “Mathematics Days in Sofia”), Sofia, Bulgaria, 2017, pp. 73-80.Search in Google Scholar

6. Davydov, A. A., L. M. Tombak. Quasiperfect Linear Binary Codes with Minimal Distance 4 and Complete Caps in Projective Geometry. − Problems Inform. Transm., Vol. 25, 1989, No 4, pp. 265-275.Search in Google Scholar

7. Davydov, A. A., L. M. Tombak. An Alternative to the Hamming Code in the Class of SECDED Codes in Semiconductor Memory. − IEEE Trans. Inform. Theory, Vol. IT-37, 1991, No 3, pp. 897-902.10.1109/18.79958Search in Google Scholar

8. Dodunekova, R. Extended Binomial Moments of a Linear Code and the Undetected Error Probability. − Problems Inform. Transm., Vol. 39, 2003, No 3, pp. 255-265.10.1023/A:1026162531539Search in Google Scholar

9. Dodunekova, R., S. M. Dodunekov, E. Nikolova. A Survey on Proper Codes. − Discrete Appl. Math., Vol. 156, 2008, No 9, pp. 1499-1509.10.1016/j.dam.2005.06.014Search in Google Scholar

10. Dodunekova, R., S. M. Dodunekov. t-Good and t-Proper Linear Error Correcting Codes. − Mathematica Balkanica. New Series, Vol. 17, 2003, No 1-2, pp.147-154.Search in Google Scholar

11. Dodunekova, R., E. Nikolova. Sufficient Conditions for Monotonicity of the Undetected Error Probability for Large Channel Error Probabilities. − Probl. Inform. Transm., Vol. 41, 2005, No 3, pp. 187-198.10.1007/s11122-005-0023-5Search in Google Scholar

12. Khatirinejad, M., P. Lisonek. Classification and Constructions of Complete Caps in Binary Spaces. − Des. Codes Cryptogr., Vol. 39, 2006, No 1, pp. 17-31.10.1007/s10623-005-2140-ySearch in Google Scholar

13. Kløve, T. Codes for Error Detection. Singapore, World Scientific, 2007.10.1142/6400Search in Google Scholar

14. MacWilliams, F. J., N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.Search in Google Scholar

15. Panchenko, V. I. On Optimization of Linear Code with Distance 4. − In: Proc. of 8th All-Union Conf. on Coding Theory and Communications, Kuibyshev, 1981, Part 2: Coding Theory, Moscow, 1981, pp. 132-134 (in Russian).Search in Google Scholar

Polecane artykuły z Trend MD

Zaplanuj zdalną konferencję ze Sciendo