Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Data (E) > Coding And Information Theory (E.4) > Error Control Codes (E.4...)  
 
Options:
 
  1-10 of 19 Reviews about "Error Control Codes (E.4...)": Date Reviewed
  Polynomial theory of error correcting codes
Cancellieri G., Springer Publishing Company, Incorporated, New York, NY, 2014. 732 pp.  Type: Book (978-3-319017-26-6)

We all know a famous saying: “Mathematics is the queen of science, and number theory is the crown of the queen.” In a similar manner, one can say that coding theory is the queen of information and communication tech...

Aug 19 2015
  On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements
Kovalenko M., Urbanovich T. Problems of Information Transmission 50(1): 79-89, 2014.  Type: Article

An incidence geometry is, briefly described, a set of elements that have a different type and an incidence relation satisfying certain axioms. Typical examples include projective spaces, affine spaces, and polar spaces. The elements of...

Feb 2 2015
   Linear network error correction coding
Guang X., Zhang Z., Springer Publishing Company, Incorporated, New York, NY, 2014. 107 pp.  Type: Book (978-1-493905-87-4)

Make a friend on Facebook, send an email to a friend or colleague, pay your credit card bills, or make a phone call--you are always using a computer network. They are the fundamental backbone of information and communications ...

Dec 8 2014
  List decodability at small radii
Chee Y., Ge G., Ji L., Ling S., Yin J. Designs, Codes and Cryptography 61(2): 151-166, 2011.  Type: Article

In many cases, it is impossible for a decoding algorithm to specify a unique codeword closest to a received word; list decoding refers to the technique of producing a short list of possible codewords. The key concept is (e
Feb 2 2012
  PEDS: a parallel error detection scheme for TCAM devices
Bremler-Barr A., Hay D., Hendler D., Roth R. IEEE/ACM Transactions on Networking 18(5): 1665-1675, 2010.  Type: Article

Computer network communications require fast packet categorization schemes for effective network administration and security. Computer networks are equipped with routers that organize and process packets according to patterns of rules ...

Sep 8 2011
  Forward correction and fountain codes in delay-tolerant networks
Altman E., De Pellegrini F. IEEE/ACM Transactions on Networking 19(1): 1-13, 2011.  Type: Article

Imagine a colony of ants. One of the ants is walking around with a notepad. This ant needs to send a message to a fellow ant, so it writes the message and hands it over to the next ant that it encounters. All of the ants move in a rand...

Sep 7 2011
  Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56
Harada M. Designs, Codes and Cryptography 38(1): 5-16, 2006.  Type: Article

If you want to know that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56, that the code words of minimum weight generate an extremal...

Jan 15 2008
  A note on the decoding complexity of error-correcting codes
Gronemeier A. Information Processing Letters 100(3): 116-119, 2006.  Type: Article

One main task of coding theory is to construct good error-correcting codes, and, in practice, a good code must have efficient encoding and decoding algorithms. Moreover, a family of codes is asymptotically good provided that there exis...

May 16 2007
  Introduction to coding theory
Roth R., Cambridge University Press, New York, NY, 2006. 578 pp.  Type: Book (9780521845045)

“Error correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems.” With this sentence, Ron Roth sets the stage for hi...

Jan 5 2007
  Two new four-error-correcting binary codes
Östergård P. Designs, Codes and Cryptography 36(3): 327-329, 2005.  Type: Article

The author constructs two, four-error-correcting binary codes of lengths 21 and 22, thus improving the lower bound of A(21,9) and A(22,9). These two new codes are unions of cosets of linear codes o...

Jun 23 2006
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy