Results 31 to 40 of about 521,304 (203)
, 2006 BCH kodlarının ele alındığı bu çalışma, altı bölümden oluşmaktadır. Bölüm 1'de BCH kodları için gerekli cebirsel bilgiler verilmiştir. Sonlu cisimler ve sonlu cisimlerin yapısı incelenmiştir. Bölüm 2'de sonlu cisimler üzerinde polinomlardan söz
Çalkavur, Selda
core +1 more source
On the decoding of quasi-BCH codes [PDF]
, 2013 International audienceIn this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH
Quintin, Guillaume +2 more
core +3 more sources
A Family of Ternary Quasi-Perfect BCH Codes
, 2008 In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
Dodunekov, Stefan,, Danev, Danyo,
core +1 more source
Scientific Reports, 2021 Semiconductor superlattice secure key distribution (SSL-SKD) has been experimentally demonstrated to be a novel scheme to generate and agree on the identical key in unconditional security just by public channel.
Jianguo Xie +6 more
doaj +1 more source
A Spectral Algorithm for Decoding Systematic BCH Codes
IEEE Access, 2022 A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity.
Sergei Valentinovich Fedorenko
doaj +1 more source
Educational pathways and outcomes for care‐experienced children: A 16‐year longitudinal study
British Educational Research Journal, EarlyView.Abstract Children who are removed from their birth families during childhood—termed care‐experienced—can be at risk for lower educational attainment and poorer school experiences, often linked to deprivation and behavioural factors. However, research often uses aggregated measures that obscure the complexities of care (e.g.
Emily Lowthian +9 more
wiley +1 more source
Some Hermitian Dual Containing BCH Codes and New Quantum Codes [PDF]
, 2014 : Let q=3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q 2-ary narrow-sense (NS) BCH codes of length n = (q6 −1) 3 and n=3(q 2 − 1)(q 2 + q+1) are determined.
Fangchi Liang +5 more
core +1 more source
British Educational Research Journal, EarlyView.Abstract Teacher retention is often explained through workload, job satisfaction and burnout, but these accounts have examined less systematically whether teachers experience their profession as socially and institutionally recognised. Drawing on recognition theory, this study examines how occupational recognition is configured across material and ...
Mengting Qian +3 more
wiley +1 more source
Information and Control, 1967 The BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimum distance to code length. Does this happen because the codes actually deteriorate or does the bound just become loose? It is shown that the BCH bound gives the true minimum distance within a factor of two. We conclude that it is the codes, not the bound,
Shu Lin 0001, E. J. Weldon Jr.
openaire +2 more sources
Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms
Journal of Electrical and Computer Engineering, 2012 Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-𝑖 ...
Abdeslam Ahmadi +3 more
doaj +1 more source