Zobrazeno 1 - 10
of 2 192
pro vyhledávání: '"Tomlinson, M"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Maternal & Child Health Journal; Apr2024, Vol. 28 Issue 4, p700-707, 8p
Autor:
Stansert Katzen, L., Skeen, S., Dippenaar, E., Laurenzi, C., Notholi, V., le Roux, K., le Roux, I., WaluWalu, N., Mbewu, N., Rotheram Borus, M. J., Tomlinson, M.
Publikováno v:
Discover Health Systems; 1/30/2024, Vol. 3 Issue 1, p1-11, 11p
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the extended
Externí odkaz:
http://arxiv.org/abs/0801.3926
This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a Multi-Guess
Externí odkaz:
http://arxiv.org/abs/cs/0503006
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2^m), where m>0 cyclic low-density parity-check codes. The construction method produces the dual code idempotent which is us
Externí odkaz:
http://arxiv.org/abs/cs/0502037
An algorithm of improving the performance of iterative decoding on perpendicular magnetic recording is presented. This algorithm follows on the authors' previous works on the parallel and serial concatenated turbo codes and low-density parity-check c
Externí odkaz:
http://arxiv.org/abs/cs/0502036
It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the iterative de
Externí odkaz:
http://arxiv.org/abs/cs/0502035