Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Peter Kazakov"'
Publikováno v:
2022 10th International Workshop on Signal Design and Its Applications in Communications (IWSDA).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb418bd73c4293d27f27ea217735e0ab
https://doi.org/10.1109/iwsda50346.2022.9870589
https://doi.org/10.1109/iwsda50346.2022.9870589
Autor:
Tsonka Baicheva, Peter Kazakov
Publikováno v:
BCI
An efficient scheme to increase the performance of polar codes at short and moderate block lengths is a concatenation of CRC code and a polar code. In order to obtain better result of the concatenation, a CRC code with best error control performance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9825345909eff405845ef8795bee0d1
https://doi.org/10.1145/3351556.3351573
https://doi.org/10.1145/3351556.3351573
Publikováno v:
Computer Communications. 21:1030-1033
Polynomials of degree eight over GF(2) which are suitable to be used as generator polynomials for cyclic redundancy-check (CRC) codes are investigated. Their minimum distance, properness and undetected error probability for binary symmetric channels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::230fe27be94bd5e8b5bef0e772bd238d
https://doi.org/10.1016/s0140-3664(98)00165-0
https://doi.org/10.1016/s0140-3664(98)00165-0
Publikováno v:
IEE Proceedings - Communications. 147:253
The authors investigate the performance of cyclic redundancy check (CRC) codes generated by polynomials of degree 16 over GF(2) which can be used for pure error detection in communication systems. Their minimum distance, properness and undetected err
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c856b61ac08e5e3f712ebc0843410e95
https://doi.org/10.1049/ip-com:20000649
https://doi.org/10.1049/ip-com:20000649
Autor:
Kazakov, Peter
Publikováno v:
IEEE Transactions on Information Theory; Mar2001, Vol. 47 Issue 3, p1190, 6p, 4 Charts
Autor:
Boyvalenkov, P.
Publikováno v:
Discrete & Computational Geometry; Dec1995, Vol. 14 Issue 1, p167-183, 17p
Autor:
Ren-Der Lin, Wen-Shyen Chen
Publikováno v:
19th International Conference on Advanced Information Networking & Applications (AINA'05) Volume 1 (AINA papers); 2005, p480-480, 1p
Autor:
Alexander Barg, Simon Litsyn
This volume presents papers related to the DIMACS workshop,'Codes and Association Schemes'. The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results
Autor:
T. Ericson, V. Zinoviev
Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to