scientific article; zbMATH DE number 2065311

zbMATH Open1052.11083MaRDI QIDQ4459941FDOQ4459941

Authors: Haris Vikalo, B. Hassibi 

Publication date: 18 May 2004

Title of this publication is not available (Why is that?)

Recommendations

• On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Finding the closest lattice point by iterative slicing
• An efficient algorithm for clustered integer least squares problems.
• Maximum likelihood sequence estimation from the lattice viewpoint

zbMATH Keywords

closest lattice pointmaximum-likelihood decoding

Mathematics Subject Classification ID

Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16) Decoding (94B35)

Cited In (7)

• An efficient algorithm for clustered integer least squares problems.
• Finding the closest lattice point by iterative slicing
• Lossless Dimension Reduction for Integer Least Squares With Application to Sphere Decoding
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition
• Statistical Pruning for Near-Maximum Likelihood Decoding
• The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
• On the sphere-decoding algorithm I. Expected complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459941)