| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
 |
|
|
|
|
 Near-extremal formally self-dual even codes of lengths 24 and 32
Gulliver T., Harada M., Nishimura T., ostergård P. Designs, Codes and Cryptography 37(3): 465-471, 2005. Type: Article
Binary formally self-dual codes C are linear codes for which the weight enumerators of C and its dual code C⊥ are equal. Formally self-dual even codes of leng...
|
Jun 26 2006 |
|
|
|
|
|
|
Lagrangian pairs and Lagrangian orthogonal matroids
Booth R., Borovik A., White N. European Journal of Combinatorics 26(7): 1023-1032, 2005. Type: Article
In finite geometry, the symplectic spaces in V(2n,2), or equivalently in the projective space PG(2n-1,2), and the nonsingular quadrics in V(...
|
May 11 2006 |
|
|
|
|
|
|
Digital transmission engineering (IEEE Series on Digital & Mobile Communication)
Anderson J., Wiley-IEEE Press, 2005. 472 pp. Type: Book (9780471694649)
This is the second, updated, edition of this book on the transmission of digital data through space and time. It is intended for graduate students and engineers, and for those who lecture on the transmission of digital data. The prereq...
|
Jan 24 2006 |
|
|
|
|
|
|
New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
Feng G., Deng R., Bao F., Shen J. IEEE Transactions on Computers 54(9): 1071-1080, 2005. Type: Article
In many applications, multiple hard disks are used to store data. For this, a new technique, called redundant array of inexpensive disks (RAID), can be used. One problem with this technique is that the disks in RAID may fail after a fe...
|
Jan 20 2006 |
|
|
|
|
|
|
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
Barak B., Kindler G., Shaltiel R., Sudakov B., Wigderson A. Theory of computing (Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 22-24, 2005) 1-10, 2005. Type: Proceedings
A distribution X over binary strings of length n has min-entropy k if every string has a probability of at most 2-k in X. This di...
|
Oct 13 2005 |
|
|
|
|
|
|
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
Regueiro E. European Journal of Combinatorics 26(5): 577-584, 2005. Type: Article
A biplane is a (v, k, 2) design, that is, a structure of v points and v blocks such that every point belongs to exactly k blocks, and every ...
|
Aug 23 2005 |
|
|
|
|
|
|
On computing the Hamming distance
Kéri G., Kisvölcsey Á. Acta Cybernetica 16(3): 443-449, 2004. Type: Article
The Hamming distance between two n-tuples is the number of positions in which they differ. Computing the Hamming distance for a large number of pairs of words is a hard problem. It is important in coding theory since...
|
Jul 20 2005 |
|
|
|
|
|
|
An adaptive data hiding technique for binary images
Liu T., Chang L. Pattern recognition (Proceedings of the 17th International Conference on Pattern Recognition (ICPR’04) Volume 4,Aug 23-26, 2004) 831-834, 2004. Type: Proceedings
A method is presented for embedding secure data in binary images. The secure data is hidden in the edge portion of a host binary image. This is motivated by the fact that the edge portion of an image is more difficult to recognize with...
|
Jul 7 2005 |
|
|
|
|
|
|
Permutation statistics and the q, t-Catalan sequence
Loehr N. European Journal of Combinatorics 26(1): 83-93, 2005. Type: Article
The Catalan numbers play a prominent role in combinatorics. Stanley’s book on enumerative combinatorics [1] lists over 95 collections of objects counted by the Catalan numbers. One of the collections of objects counted by the...
|
May 13 2005 |
|
|
|
|
|
| |
|
|
| |
|
|
