Results 201 to 210 of about 3,060,918 (217)
Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
Problems of Information Transmission, 2015 The well-known approach of Bose, Ray-Chaudhuri, and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum Hamming distance of simple-root cyclic codes.
Zeh, Alexander, Ulmschneider, Markus
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On matrix-product structure of repeated-root constacyclic codes over finite fields
Discrete Mathematics, 2020Yuan Cao, Yonglin Cao, Paravee Maneejuk
exaly
On the -distance of repeated-root constacyclic codes of prime power lengths
Discrete Mathematics, 2020Xiaoqiang Wang +2 more
exaly
A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
IEEE Transactions on Information Theory, 1997Cheong Boon Soh, E Gunawan
exaly
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
IEEE Transactions on Information Theory, 2018Zhi Ma, Lan Luo
exaly
On the Hamming distances of repeated-root constacyclic codes of length
Discrete Mathematics, 2019Xiaoqiang Wang +2 more
exaly
On LCD repeated-root cyclic codes over finite fields
Journal of Applied Mathematics and Computing, 2017Shixin ZHU, Jin Li, Binbin Pang
exaly
Repeated-Root Constacyclic Codes of Length kℓpsk\ell p^s
Bulletin of the Malaysian Mathematical Sciences Society, 2019Minjia Shi
exaly
On the symbol-pair distances of repeated-root constacyclic codes of length
Discrete Mathematics, 2019Xiaoqiang Wang +2 more
exaly
Repeated-Root Isodual Cyclic Codes over Finite Fields
Lecture Notes in Computer Science, 2015Thomas Aaron Gulliver +2 more
exaly