Results 1 to 10 of about 7,149,925 (323)
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 ...
Lin, Shih-Chun +2 more
openaire +4 more sources
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
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes [PDF]
SIAM Journal on Discrete Mathematics, 2017 Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades.
Shuxing Li
semanticscholar +3 more sources
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
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]
International Workshop on Arithmetic of Finite Fields, 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
Generalized minimum distance functions [PDF]
Journal of Algebraic Combinatorics, 2018 J. Algebraic Combin., to appear.
González-Sarabia, Manuel +3 more
openaire +4 more sources
Minimum distance of symplectic Grassmann codes [PDF]
Linear Algebra and its Applications, 2016 Revised contents and ...
Cardinali, Ilaria, Giuzzi, Luca
openaire +4 more sources
On the minimum distance of elliptic curve codes [PDF]
International Symposium on Information Theory, 2015 Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [1] showed that it is an NP-hard problem for general linear codes.
Jiyou Li, D. Wan, Jun Zhang
semanticscholar +3 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