Cover Image

Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hernando, Fernando, Igual, Francisco D., Quintana-Ortí, Gregorio
Format:	Preprint
Published:	2016
Subjects:	Information Theory 68Q30, 68Q25, 65F30, 11Y16
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Implementing Basic Arithmetic in $\mathbb{F}_p$ via $\mathbb{F}_2$, and Its Application for Computing the Hamming Distance of Linear Codes
by: Hernando, Fernando, et al.
Published: (2026)

No Constant-Cost Protocol for Point--Line Incidence
by: Göös, Mika, et al.
Published: (2026)

Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes
by: Sorenson, Jonathan P., et al.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Low-Memory Numerical Certification
by: Breiding, Paul, et al.
Published: (2026)

Superfast 1-Norm Estimation
by: Go, Soo, et al.
Published: (2025)

On the randomized Euler scheme for SDEs with integral-form drift
by: Przybyłowicz, Paweł, et al.
Published: (2024)

Hybrid hierarchical matrices with adaptive mixed precision storage
by: Khan, Ritesh, et al.
Published: (2026)

Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesis
by: Sakabe, Eduardo Y., et al.
Published: (2025)

An algorithm and computation to verify Legendre's Conjecture up to $3.33\cdot10^{13}$
by: Sorenson, Jonathan, et al.
Published: (2024)

Rigorous methods for computational number theory
by: de Boer, Koen, et al.
Published: (2025)

A Random Integration Algorithm for High-dimensional Function Spaces
by: Chen, Liang, et al.
Published: (2024)

Certified Real Eigenvalue Location
by: Solmaz, Baran, et al.
Published: (2026)

The complexity of accurate floating point computation
by: Demmel, James
Published: (2003)

Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers
by: Moore, Sara, et al.
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)

On the Characteristic Polynomial of Linearized Polynomials
by: Bastioni, Luca, et al.
Published: (2025)

Random Walks, Faber Polynomials and Accelerated Power Methods
by: Cowal, Peter, et al.
Published: (2025)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
by: Ye, Lixi
Published: (2026)

Multi- and Infinite-variate Integration and $L^2$-Approximation on Hilbert Spaces with Gaussian Kernels
by: Gnewuch, Michael, et al.
Published: (2024)

A multilevel Monte Carlo algorithm for SDEs driven by countably dimensional Wiener process and Poisson random measure
by: Sobieraj, Michał
Published: (2023)

Generalised Möbius Categories and Convolution Kleene Algebras
by: Cranch, James, et al.
Published: (2025)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Product gales and Finite state dimension
by: S, Akhil
Published: (2025)

Optimal sampling for least squares approximation with general dictionaries
by: Trunschke, Philipp, et al.
Published: (2024)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
by: Hartman, Samuel, et al.
Published: (2024)

All Equalities Are Equal, but Some Are More Equal Than Others: The Effect of Implementation Aliasing on the Numerical Solution to Conservation Equations
by: Trojak, Will, et al.
Published: (2019)

Fast Maxwell Solvers Based on Exact Discrete Eigen-Decompositions I. Two-Dimensional Case
by: Wang, Lixiu, et al.
Published: (2025)

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
by: Mantovanelli, Marco
Published: (2026)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

On the complexity of quantum numerical integration: an angle-structure characterization
by: Chinesta, Francisco, et al.
Published: (2026)

A sharp uniform-in-time error estimate for Stochastic Gradient Langevin Dynamics
by: Li, Lei, et al.
Published: (2022)

Boundaries in Hypernetwork Theory: Structure and Scope
by: Charlesworth, Richard D.
Published: (2025)

Fast variable density node generation on parametric surfaces with application to mesh-free methods
by: Duh, Urban, et al.
Published: (2020)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Towards an Efficient Shifted Cholesky QR for Applications in Model Order Reduction using pyMOR
by: Bindhak, Maximilian, et al.
Published: (2025)

Heart Disease Detection using Quantum Computing and Partitioned Random Forest Methods
by: Heidari, Hanif, et al.
Published: (2022)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)