Results 191 to 200 of about 25,553 (228)
Some of the next articles are maybe not open access.
2009
The Code for the Construction and Equipment of Ships Carrying Dangerous Chemicals in Bulk (BCH Code) presents amendments to the Code to reflect the 2007 revision of MARPOL Annex II and other amendments related to: Survey and certification Materials of construction Fire protection
openaire +1 more source
The Code for the Construction and Equipment of Ships Carrying Dangerous Chemicals in Bulk (BCH Code) presents amendments to the Code to reflect the 2007 revision of MARPOL Annex II and other amendments related to: Survey and certification Materials of construction Fire protection
openaire +1 more source
On a class of primitive BCH-codes
IEEE Transactions on Information Theory, 1990The author introduces a special class of primitive BCH codes, the minimal BCH (MB) codes. It is proved that an MB code has as minimum distance its designed distance. Using the Roos bound, the author proposes a lower bound, sometimes tight, for the minimum distance of the dual of an MB code.
openaire +1 more source
2021
Tämän tutkielman tarkoituksena on tutustuttaa lukija BCH-koodeihin. BCH-koodit ovat syklisiä koodeja ja ne pystyvät korjaamaan useita virheitä. Tutkielmassa esitetään erilaisia tapoja korjata koodisanoihin tulleita virheitä käyttäen hyväksi äärellisten kuntien teoriaa ja lineaari- sekä polynomialgebraa.
openaire +1 more source
Tämän tutkielman tarkoituksena on tutustuttaa lukija BCH-koodeihin. BCH-koodit ovat syklisiä koodeja ja ne pystyvät korjaamaan useita virheitä. Tutkielmassa esitetään erilaisia tapoja korjata koodisanoihin tulleita virheitä käyttäen hyväksi äärellisten kuntien teoriaa ja lineaari- sekä polynomialgebraa.
openaire +1 more source
On the duals of binary BCH codes
IEEE Transactions on Information Theory, 2001Summary: We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
openaire +1 more source
Two families of negacyclic BCH codes
Designs, Codes, and Cryptography, 2023Xiaoqiang Wang +2 more
exaly
On subgroup subcodes of BCH codes
J. Inf. Process. Cybern., 1991Summary: An approach to multiple errors correcting \(q\)-ary codes, viewed as subgroup subcodes of BCH codes, is presented. It has been shown that in the case of \(d\leqq q=p^ l\) for an infinite sequence of lengths the cardinality of obtained codes exceeds the cardinality of the corresponding BCH codes not less than \((q/p)^{d-2}\) times, i.e.
openaire +2 more sources