REVIEW 4 cited by
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call Multiple Impulse Method MIM, where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.
Forward citations
Cited by 4 Pith papers
-
Deep ReLU networks -- injectivity capacity upper bounds
For deep ReLU networks with random Gaussian weights, the paper gives upper bounds on the layer expansion needed for injectivity and finds the expansion need saturates by four layers.
-
Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT
For the asymmetric binary perceptron, the worst-case local entropy breaks down for constraint density alpha in (0.77, 0.78), matching replica predictions and the range where fast algorithms stop working.
-
Fully lifted \emph{blirp} interpolation -- a large deviation view
A large-deviation upgrade of fully lifted blirp interpolation is derived, yielding explicit derivative identities that the author links to local entropy and computational gaps in perceptron models.
-
A large deviation view of \emph{stationarized} fully lifted blirp interpolation
The paper derives new derivative identities for a stationarized fully lifted bilinearly indexed random process interpolator and states an equality between large deviation limits at the opposite ends of an interpolation path.
Discussion (0). Continue with ORCID to comment.