Signature codes for noisy multiple access adder channel

DOI10.1007/s10623-016-0228-1zbMath1402.94040OpenAlexW2470294350MaRDI QIDQ510479

Vladimir Gritsenko, Vladimir Lebedev, Grigory Kabatiansky, Alexey Maevskiy

Publication date: 10 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10623-016-0228-1

zbMATH Keywords

group testingmultiple access adder channelnon-adaptive search of counterfeit coinssignature codes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Extremal set theory (05D05) Information theory (general) (94A15)

Related Items (4)

Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ Signature codes for noisy multiple access adder channel ⋮ Separable collusion-secure multimedia codes ⋮ Compositional restricted multiple access channel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On error correction with errors in both the channel and syndrome
• Signature codes for noisy multiple access adder channel
• Solution of Ulam's problem on searching with a lie
• Improved upper bound on the probability of decoding error for codes of complex structure
• \(\delta\)-decodable code constructions for a T-user adder channel
• A coding model for a multiple-access adder channel
• An improved algorithm for quantitative group testing
• Reconstructing weighted graphs with minimal query complexity
• On \(B_ 2\)-sequences of vectors
• Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Coding for T-user multiple-access channels
• A multiuser k-ary code for the noisy multiple-access adder channel
• Search for Sparse Active Inputs: A Review
• Determination of a Subset from Certain Combinatorial Properties
• Compressed sensing
• Binary \(B_2\)-sequences: a new upper bound

This page was built for publication: Signature codes for noisy multiple access adder channel