|
On Information Theory Parameters of Infinite Anti-uniform Sources
|
#
|
1386 - 07
|
|
|
On the Quaternary Projection of Binary Linear Block Codes
|
#
|
1386 - 07
|
|
|
G-projectable and A-projectable binary linear block codes
|
#
|
1386 - 07
|
|
|
On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices
|
#
|
1386 - 05
|
|
|
On Finite Antiuniform Probability Distributions
|
#
|
1386 - 01
|
|
|
Maximum-girth slope-based quasi-cyclic ( k 5)-LDPC codes
|
#
|
1386 - 01
|
|
|
The Minimum Average Code for Finite Memoryless Monotone Sources
|
#
|
1385 - 12
|
|
|
More on the Fibonacci sequence and Hessenberg matrices
|
#
|
1385 - 07
|
|
|
On the 32 16 8 BCH and Quadratic Residue Codes
|
#
|
1385 - 01
|
|
|
Optimal binary linear codes containing the product code ( 6 5 2 Kronecker product 3 1 3 )
|
#
|
1384 - 01
|
|
|
On the structure of optimal linear block codes of length a multiple of four
|
#
|
1383 - 10
|
|
|
A new CDMA/SDMA structure with transmit diversity
|
#
|
1383 - 01
|
|
|
ATree based Algorithm for Generating All Possible Binary Compact Codes with N Codewords
|
#
|
1382 - 07
|
|
|
On the Pless construction and ML decoding of 48.24.12 Quadratic Residue code
|
#
|
1382 - 03
|
|
|
Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis
|
#
|
1380 - 07
|
|
|
Acyclic Tanner Graphs and Maximum-Likelihood Decoding of Linear Block Codes
|
#
|
1379 - 09
|
|
|
The Minimal Generator Matrix of a Vector Space
|
#
|
1378 - 05
|
|
|
A Link Between Quasi-Cyclic Codes and Convolutional Codes
|
#
|
1376 - 10
|
|
|
Quasi-Cyclic Structure of Reed-Muller Codes and Their Smallest Regular Trellis Diagram
|
#
|
1376 - 02
|
|
|
Trellis complexity of linear block codes via atomic codewords
|
#
|
1374 - 01
|
|