PROJECT TITLE :

List-Decoding Algorithms for Lifted Codes

ABSTRACT:

Lifted Reed–Solomon codes are a natural affine-invariant family of error-correcting codes, that generalize Reed–Muller codes. They were known to have economical native-testing and native-decoding algorithms (comparable with the known algorithms for Reed–Muller codes), however with considerably better rate. We provide economical algorithms for list decoding and local list decoding of lifted codes. Our algorithms are based on a brand new technical lemma, which says that the codewords of lifted codes are low degree polynomials when viewed as univariate polynomials over a huge field (while they'll be terribly high degree when viewed as multivariate polynomials over a small field).


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Millimeter-Wave Mobile Sensing and Environment Mapping Models, Algorithms and Validation ABSTRACT: One relevant research paradigm, particularly at mm-wave and sub-THz bands, is to integrate efficient connectivity,
PROJECT TITLE :Real-Time Trajectory Planning for Autonomous Urban Driving: Framework, Algorithms, and VerificationsABSTRACT:This paper focuses on the real-time trajectory planning downside for autonomous vehicles driving in realistic
PROJECT TITLE :Euclidean Distance Matrices: Essential theory, algorithms, and applicationsABSTRACT:Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple;
PROJECT TITLE : Network Resource Allocation for Users With Multiple Connections Fairness and Stability - 2014 ABSTRACT: This paper studies network resource allocation between users that manage multiple connections, possibly
PROJECT TITLE : Joint Routing and Resource Allocation for Delay Minimization in Cognitive Radio Based Mesh Networks - 2014 ABSTRACT: This paper studies the joint design of routing and resource allocation algorithms in cognitive