Results 81 to 90 of about 1,776 (185)
Orchid genome evolution and trait innovation
Orchids became one of the world's most diverse plant groups through genome‐driven innovations, unique relationships with fungi and pollinators, and remarkable adaptability. This review explains the origins of orchids and the evolution of their distinctive life forms, flowers, and ecological strategies and highlights promising directions for future ...
Meng‐Yao Zeng +8 more
wiley +1 more source
ABSTRACT We investigated whether sleep microstructures show spatial differences in young children with autism compared with typically developing peers. 32‐channel electroencephalography (EEG) during natural sleep after 5–6 h of partial sleep deprivation was recorded from 53 children (26 with autism, 27 typically developing; 1.1–5.1 years).
Kevin Liu +7 more
wiley +1 more source
Polynomial invariants of G-orbit errors of BCH codes and its application
The article addresses the further development of methods of BCH codes norm decoding. The authors propose to use new syndrome invariants - polynomial invariants of automorphism group G of a family of BCH codes.
V. A. Lipnitski, E. V. Sereda
doaj
IDENTIFICATION OF ERRORS WITH BCH CODES USING BASICS AND COMPLEMENTARY NORMS OF SYNDROMES
The complexity of the norm decoding is exanimated. The results of computational experiments in the norm decoding for BCH codes are presented. Analysis of the results shows that part of the norm instead the whole norm of the syndrome can be used for the ...
V. K. Konopelko, D. N. Hoang
doaj
The dual codes of two families of BCH codes
In this paper, we present an infinite family of MDS codes over $\mathbb{F}_{2^s}$ and two infinite families of almost MDS codes over $\mathbb{F}_{p^s}$ for any prime $p$, by investigating the parameters of the dual codes of two families of BCH codes. Notably, these almost MDS codes include two infinite families of near MDS codes over $\mathbb{F}_{3^s}$,
Haojie Xu, Xia Wu, Wei Lu, Xiwang Cao
openaire +2 more sources
ANALYSIS OF DECODERS BIT ERROR FOR RIJNDAEL And BCH codes
The nonlinear error control code on the basis of cryptographic transformation of data through Rijndael algorithm is considered. Bit error properties of decoding algorithms of Rijndael codes and BCH codes for AWGN channel are compared.
D. M. Bildziuk, S. B. Salomatin
doaj
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed.
Grassl, Markus, Beth, Thomas
openaire +2 more sources
Noncyclic generalizations of BCH and srivastava codes
We define two classes of linear error correcting codes which are noncyclic generalizations of the well known BCH and Srivastava codes. The corresponding parity check matrices are basically alternating functions of certain elements of GF(qm) and all determinants of maximum order of the parity check matrices are alternants.
openaire +1 more source
Multirate Filter Bank Representations of RS and BCH Codes
This paper addresses the use of multirate filter banks in the context of error-correction coding. An in-depth study of these filter banks is presented, motivated by earlier results and applications based on the filter bank representation of Reed-Solomon (
Van Meerbergen Geert, Moonen Marc
doaj
THEORY OF NORMAL syndrome and PLUS-decoding
The results of the study are not primitive BCH codes with decoding the guide, the potential is much greater than the design possibilities. The efficiency of automorphisms of codes, norms theory syndromes in the correction of all admissible-Mykh minimum ...
V. A. Lipnitski, A. O. Aliaksiuk
doaj

