Results 1 to 10 of about 619,731 (145)

Bounds for the minimum distance function [PDF]

open access: yesAnalele 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]

open access: yesEntropy, 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

Some new QEC MDS codes with large minimum distance [PDF]

open access: yesScientific Reports
The 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

Speeding Up Minimum Distance Randomness Tests

open access: yesJournal 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

New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields

open access: yesIEEE 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

On Minimum Maximal Distance-k Matchings [PDF]

open access: yesDiscrete 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   +1 more source

Combining distance and anatomical information for deep-learning based dose distribution predictions for nasopharyngeal cancer radiotherapy planning

open access: yesFrontiers in Oncology, 2023
PurposeDeep-learning effectively predicts dose distributions in knowledge-based radiotherapy planning. Using anatomical information that includes a structure map and computed tomography (CT) data as input has been proven to work well.
Xinyuan Chen   +6 more
doaj   +1 more source

Fingerprinting With Minimum Distance Decoding [PDF]

open access: yesIEEE 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   +2 more sources

DEGREE DISTANCE AND MINIMUM DEGREE [PDF]

open access: yesBulletin of the Australian Mathematical Society, 2012
AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order,
Mukwembi, S., Munyira, S.
openaire   +2 more sources

Lengths for Which Fourth Degree PP Interleavers Lead to Weaker Performances Compared to Quadratic and Cubic PP Interleavers

open access: yesEntropy, 2020
In this paper, we obtain upper bounds on the minimum distance for turbo codes using fourth degree permutation polynomial (4-PP) interleavers of a specific interleaver length and classical turbo codes of nominal 1/3 coding rate, with two recursive ...
Lucian Trifina   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy