Identifying an unknown code by partial Gaussian elimination

DOI10.1007/S10623-018-00593-7MaRDI QIDQ1727382zbMATH OpenOpenAlexWikidataFDO

Authors Kevin Carrier, Jean-Pierre Tillich

Publication date 20 February 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-018-00593-7

zbMATH Keywords

linear codesLDPC codesblind reconstruction of codesother codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 6612135
• LP Decoding Corrects a Constant Fraction of Errors
• On computing nearest neighbors with applications to decoding of binary linear codes
• Message passing algorithms and improved LP decoding
• Two decoding algorithms for linear codes

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 4033660 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3597878 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 1182506 (Why is no real title available?)
• scientific article; zbMATH DE number 1461526 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• scientific article; zbMATH DE number 6541785 (Why is no real title available?)
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Beyond locality-sensitive hashing
• Blind detection of interleaver parameters
• Blind recognition of punctured convolutional codes
• Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
• Code Reverse Engineering Problem for Identification Codes
• Codes on graphs: normal realizations
• Decoding linear codes with high error rate and its impact for LPN security
• Detection and recognition of a binary linear code
• Efficient secure channel coding based on quasi-cyclic low-density parity-check codes
• Modern Coding Theory
• New directions in nearest neighbor searching with applications to lattice sieving
• On computing nearest neighbors with applications to decoding of binary linear codes
• Optimal Hash Functions for Approximate Matches on the $n$-Cube
• Optimal data-dependent hashing for approximate near neighbors
• Sampling-based dimension reduction for subspace approximation
• Weight Distribution of Low-Density Parity-Check Codes

Cited in

(3)

• Linear codes interpolation from noisy patterns by means of a vector quantization process
• Code Reverse Engineering Problem for Identification Codes
• Properties of syndrome distribution for blind reconstruction of cyclic codes

This page was built for publication: Identifying an unknown code by partial Gaussian elimination

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