Identifying an unknown code by partial Gaussian elimination
From MaRDI portal
Publication:1727382
DOI10.1007/s10623-018-00593-7zbMath1421.94090OpenAlexW2906370070WikidataQ128776095 ScholiaQ128776095MaRDI QIDQ1727382
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blind recognition of punctured convolutional codes
- Blind detection of interleaver parameters
- Decoding linear codes with high error rate and its impact for LPN security
- Efficient secure channel coding based on quasi-cyclic low-density parity-check codes
- Optimal Data-Dependent Hashing for Approximate Near Neighbors
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Modern Coding Theory
- Asymptotic Enumeration Methods for Analyzing LDPC Codes
- Weight Distribution of Low-Density Parity-Check Codes
- Sampling-based dimension reduction for subspace approximation
- Codes on graphs: normal realizations
- New directions in nearest neighbor searching with applications to lattice sieving
- Code Reverse Engineering Problem for Identification Codes
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- Optimal Hash Functions for Approximate Matches on the $n$-Cube
- Beyond Locality-Sensitive Hashing
- Detection and recognition of a binary linear code
