Results 1 to 10 of about 3,023,466 (332)
Minimum distance of symplectic Grassmann codes [PDF]
Linear Algebra and its Applications, 2015 Revised contents and ...
Ilaria Cardinali, Luca Giuzzi
core +6 more sources
Geometry of the Minimum Distance [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2023 Abstract Let $${{\mathbb {K}}}$$ K be any field, let
John Pawlina, Ştefan Tohǎneanu
openalex +3 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
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
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
Minimum Distance Tests and Estimates Based on Ranks
Revstat Statistical Journal, 2020 It is well known that the least squares estimate in classical linear regression model is very sensitive to violation of the assumptions, in particular normality of model errors.
Radim Navrátil
doaj +2 more sources
QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE [PDF]
, 2019 Summary: The methods for constructing quantum codes is not always sufficient by itself. Also, the constructed quantum codes as in the classical coding theory have to enjoy a quality of its parameters that play a very important role in recovering data efficiently.
Emre Kolotoğlu, Mustafa Sarı
openalex +3 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
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
Codes that attain minimum distance in every possible direction
Open Mathematics, 2008 Katona Gyula +2 more
doaj +2 more sources