Results 11 to 20 of about 681,072 (306)
Bounds for the minimum distance function [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 Let I be a homogeneous ideal in a polynomial ring S. In this paper, we extend the study of the asymptotic behavior of the minimum distance function δI of I and give bounds for its stabilization point, rI, when I is an F -pure or a square-free monomial ...
Núñez-Betancourt Luis +2 more
doaj +3 more sources
Quantum Minimum Distance Classifier [PDF]
Entropy, 2017 We propose a quantum version of the well known minimum distance classification model called Nearest Mean Classifier (NMC). In this regard, we presented our first results in two previous works.
Enrica Santucci
doaj +2 more sources
Dihedral Codes with Prescribed Minimum Distance [PDF]
, 2021 Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the
Borello, Martino, Jamous, Abdelillah
openaire +5 more sources
Some new QEC MDS codes with large minimum distance [PDF]
Scientific ReportsThe advancement of Quantum Error-Correcting (QEC) Maximum Distance Separable (MDS) codes holds substantial importance in practical applications, substantially augmenting the reliability and efficiency of quantum communication and computing.
Lanqiang Li +3 more
doaj +2 more sources
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes [PDF]
Designs, Codes and Cryptography, 2012 Designs, Codes and Cryptography (2012)
Alexander Zeh, Sergey Bezzateev
openaire +6 more sources
Fingerprinting With Minimum Distance Decoding [PDF]
IEEE Transactions on Information Forensics and Security, 2009 26 pages, 6 figures, submitted to IEEE Transactions on Information Forensics and ...
Shih-Chun Lin 0001 +2 more
openaire +2 more sources
Speeding Up Minimum Distance Randomness Tests
Journal of Telecommunications and Information Technology, 2022 Randomness testing is one of the essential and easiest tools for the evaluation of the features and quality of cryptographic primitives. The faster we can test, the greater volumes of data can be checked and evaluated and, hence, more detailed analyses ...
Krzysztof Mańk
doaj +1 more source
The minimum Manhattan distance and minimum jump of permutations [PDF]
Journal of Combinatorial Theory, Series A, 2019 20 pages, 3 figures.
Simon R. Blackburn +2 more
openaire +3 more sources
New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
IEEE Access, 2020 Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj +1 more source
The minimum miss distance problem [PDF]
Proceedings of the American Mathematical Society, 1967 I. In the statement of most extant theorems concerning optimal control, a fundamental hypothesis is that of the existence of a control function which drives the controlled system from a given initial state to a specified target. Thus the utility of these theorems is contingent upon the solution of what is itself a fundamental and difficult problem of ...
Bridgland, T. F. jun., Hinkel, J. S.
openaire +1 more source