Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
code length
Description:
The number of symbols or bits used to represent a codeword in a coding system, particularly in information and error-correction theory.
Primary topic:
Coding theory and cryptography (45%)
Related topics:
Coding theory and cryptography (45%),
graph theory and CDMA systems (8%),
Error Correcting Code Techniques (8%)
OpenAlex ID:
keywords/code-length
Polyphase codes with good periodic correlation properties (Corresp.)
1972
·
D. Chu
·
IEEE Transactions on Information Theory
·
1,880
Stochastic Complexity in Statistical Inquiry
1998
·
J Rissanen
·
WORLD SCIENTIFIC eBooks
·
1,561
Stochastic Complexity and Modeling
1986
·
Jorma Rissanen
·
The Annals of Statistics
·
1,012
PDF
Fisher information and stochastic complexity
1996
·
J.J. Rissanen
·
IEEE Transactions on Information Theory
·
963
On the Locality of Codeword Symbols
2012
·
Parikshit Gopalan
, Cheng Huang
, et al.
·
IEEE Transactions on Information Theory
·
936
PDF
Algebraic coding theory
2008
·
Norman L. Biggs
·
Springer undergraduate mathematics series
·
763
Coherent ultrashort light pulse code-division multiple access communication systems
1990
·
J.A. Salehi
, A.M. Weiner
, et al.
·
Journal of Lightwave Technology
·
499
A new table of constant weight codes
1990
·
A.E. Brouwer
, J.B. Shearer
, et al.
·
IEEE Transactions on Information Theory
·
459
Attacking and Defending the McEliece Cryptosystem
2008
·
Daniel J. Bernstein
, Tanja Lange
, et al.
·
Lecture notes in computer science
·
437
PDF
Entropy estimation of symbol sequences
1996
·
Thomas Schürmann
, Peter Grassberger
·
Chaos An Interdisciplinary Journal of Nonlinear Science
·
363
PDF
Optimal probabilistic fingerprint codes
2008
·
Gábor Tardos
·
Journal of the ACM
·
271
Index Coding with Side Information
2006
·
Ziv Bar-Yossef
, Yitzhak Birk
, et al.
·
Annual Symposium on Foundations of Computer Science
·
253
The condition for a cyclic code to have a complementary dual
1994
·
Xiang Yang
, James L. Massey
·
Discrete Mathematics
·
239
Optimal probabilistic fingerprint codes
2003
·
Gábor Tardos
·
ACM Symposium on Theory of Computing (STOC)
·
226
A Novel Puncturing Scheme for Polar Codes
2014
·
Runxin Wang
, Rongke Liu
·
IEEE Communications Letters
·
202
Further results on error correcting binary group codes
1960
·
R.C. Bose
, D.K. Ray-Chaudhuri
·
Information and Control
·
182
Almost MDS Codes
1996
·
Mario A. De Boer
·
Designs Codes and Cryptography
·
176
Generalizations of the BCH bound
1972
·
C.R.P. Hartmann
, K.K. Tzeng
·
Information and Control
·
174
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
1974
·
T. Kasami
·
IEEE Transactions on Information Theory
·
173
Bounds on the size of linear codes
1998
·
AE Andries Brouwer
·
TU/e Research Portal
·
169
Optimal probabilistic fingerprint codes
2003
·
Gábor Tardos
·
ACM Symposium on Theory of Computing (STOC)
·
167
Further results on the covering radius of codes
1986
·
G. Cohen
, A. Lobstein
, et al.
·
IEEE Transactions on Information Theory
·
163
Compression as a Universal Principle of Animal Behavior
2013
·
Ramon Ferrer‐i‐Cancho
, Antoni Hernández‐Fernández
, et al.
·
Cognitive Science
·
150
PDF
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
2007
·
Boris Škorić
, Stefan Katzenbeisser
, et al.
·
Designs Codes and Cryptography
·
147
Coding and decoding strategies for multi-class learning problems
2003
·
Terry Windeatt
, Reza Ghaderi
·
Information Fusion
·
147
Show more works
View as search
Works count:
1,586
Citation count:
23,740
Year
Topic
Type