Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
High-rate random-like spherical fingerprinting codes with linear decoding complexity
Jean Franois Jourdas,
Pierre Moulin
Electrical and Computer Engineering
Beckman Institute for Advanced Science and Technology
Statistics
Information Trust Institute
Coordinated Science Lab
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'High-rate random-like spherical fingerprinting codes with linear decoding complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Fingerprinting Codes
100%
Decoding Complexity
100%
Linear Programming Decoding
100%
Number of Users
40%
Subcodes
40%
Colluders
40%
Low Dose Rate
20%
Matched Filter
20%
Practical Implementation
20%
Error Probability
20%
Fingerprinting
20%
(R)-1
20%
Additive White Gaussian Noise
20%
Capacity Constraints
20%
Collusion Attack
20%
Viterbi Algorithm
20%
Minimum Distance
20%
Robust Features
20%
Code Size
20%
Achievable Rate
20%
Declare
20%
Turbo Codes
20%
Code Construction
20%
Algebraic Construction
20%
Averaging Attack
20%
Interleaving Attack
20%
List Viterbi Decoding
20%
Computer Science
Decoding Complexity
100%
Capacity Limit
50%
Achievable Rate
50%
Additive White Gaussian Noise
50%
Decoding Algorithm
50%
viterbi decoding
50%
Code Construction
50%
Engineering
Decoding Complexity
100%
Limited Number
50%
Matched Filter
50%
Additive White Gaussian Noise
50%
Achievable Rate
50%
Code Length
50%
Decoding Algorithm
50%