Zobrazeno 1 - 10
of 570
pro vyhledávání: '"Hamming(7,4)"'
Publikováno v:
ITW
Random input/output (RIO) code is a coding scheme that enables reading of one logical page using a single read threshold in multilevel flash memory. The construction of RIO codes is equivalent to the construction of WOM codes. Parallel RIO (P-RIO) co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcedcacbceccc304dced569d6f9c1070
https://doi.org/10.1587/transfun.e101.a.2125
https://doi.org/10.1587/transfun.e101.a.2125
Publikováno v:
Finite Fields and Their Applications. 52:370-394
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27e8ff240efb8ad30ad4c7a57d8740f0
https://doi.org/10.1016/j.ffa.2018.05.002
https://doi.org/10.1016/j.ffa.2018.05.002
Publikováno v:
General Letters in Mathematics, Vol 4, Iss 3, Pp 114-119 (2018)
The enumeration of the construction due to "Audu and Aminu"(AUNU) Permutation patterns, of a [ 7 4 2 ]- linear code which is an extended code of the [ 6 4 1 ] code and is in one-one correspondence with the known [ 7 4 3 ] - Hamming code has been repo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::317632709084c565aec84bc8bc6dc4eb
http://www.refaad.com/Files/GLM/GLM-4-3-4.pdf
http://www.refaad.com/Files/GLM/GLM-4-3-4.pdf
Autor:
Keqin Feng, Jun Zhang
Publikováno v:
Finite Fields and Their Applications. 50:338-355
Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2651f553d95500a8949a8686c59a2817
https://doi.org/10.1016/j.ffa.2017.12.008
https://doi.org/10.1016/j.ffa.2017.12.008
Autor:
Daniel R. Hawtin, Neil I. Gillespie
Publikováno v:
Gillespie, N I & Hawtin, D R 2018, ' Alphabet-almost-simple 2-neighbour-transitive codes ', Ars Mathematica Contemporanea, vol. 14, no. 2, pp. 345-357 . < http://amc-journal.eu/index.php/amc/article/view/1240 >
Ars mathematica contemporanea
Ars mathematica contemporanea
Let X be a subgroup of the full automorphism group of the Hamming graph H ( m , q ) , and C a subset of the vertices of the Hamming graph. We say that C is an ( X , 2) -neighbour-transitive code if X is transitive on C , as well as C 1 and C 2 , the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f39738b6b4985bf26d7ba51321da4154
https://doi.org/10.26493/1855-3974.1240.515
https://doi.org/10.26493/1855-3974.1240.515
Autor:
V. N. Opanasenko, S. L. Kryvyi
Publikováno v:
Cybernetics and Systems Analysis. 53:627-635
This article considers the synthesis of a neural-like Hamming network with a view to implementing the problem of classification of an input set of binary vectors. The formation of a sequence sorted by the Hamming distance as the proximity measure is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9aff916a8682c910caf7594b486379cb
https://doi.org/10.1007/s10559-017-9965-z
https://doi.org/10.1007/s10559-017-9965-z
Publikováno v:
IEEE Communications Letters. 21:1229-1232
Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD) makes polar codes competitive with the state-of-art codes. In this letter, we try to find the optimal CRC for polar codes to further improve its performance. We first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5091be0e6b1ccda65db0e7e1a90f0f2b
https://doi.org/10.1109/lcomm.2017.2672539
https://doi.org/10.1109/lcomm.2017.2672539
Publikováno v:
Journal of Communications Technology and Electronics. 62:669-685
The conditional probability (fraction) of the successful decoding of erasure patterns of high (greater than the code distance) weights is investigated for linear codes with the partially known or unknown weight spectra of code words. The estimated co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a1fa79f59610d0b154d0698892280c6
https://doi.org/10.1134/s106422691706002x
https://doi.org/10.1134/s106422691706002x
Publikováno v:
Proceedings of the IEEE. 105:1185-1190
Inspired by the awarding of the 30th jubilee IEEE medal “for exceptional contributions to information sciences and systems,” this article is dedicated to the memory of Richard W. Hamming, mathematician and computer scientist. If Shannon’s mathe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1a042912acc7461d061f1f87cbf6cec
https://doi.org/10.1109/jproc.2017.2697118
https://doi.org/10.1109/jproc.2017.2697118
Publikováno v:
Graphs and Combinatorics. 33:1405-1418
We recall the “addition formula” for a commutative association scheme. From this formula we construct a linear programming for the size of harmonic index designs and define the notion of tight designs using Fisher type inequality. We examine the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc0bb63b95515046b5b1a4ee1dbfc438
https://doi.org/10.1007/s00373-017-1784-5
https://doi.org/10.1007/s00373-017-1784-5