|
Encoding Finite Sources with Ranked Probabilities
|
# |
|
|
A Lattice-based systematic recursive construction of quasi-cyclic LDPC codes
|
# |
|
|
The Golden mean Fibonacci matrices and Partial Weakly super-increasing Sources
|
# |
|
|
Polynomial Fibonacci-Hessenberg Matrices
|
# |
|
|
Geometrically-structured Maximum-girth LDPC Block and Convolutional Codes
|
# |
|
|
On the stopping distance of Array Code Parity-check Matrices
|
# |
|
|
Cyclic and Negacyclic Codes over the Galois Ring GR(p 2 m)
|
# |
|
|
Two classes of Optimal Stopping Reundancy Codes
|
# |
|
|
Generalized Quasi-cyclic codes Structural Properties and Code Construction
|
# |
|
|
Extension of the Lasserre-Avrachenkov Theorem on the Integral of Multilinear Forms over the Simplices
|
# |
|
|
A note on cyclic codes over GR(p 2 m) of length-p k
|
# |
|
|
Cyclic and Negacyclic Codes Over The Galois Ring rm GR (p 2 m)
|
# |
|
|
A note on length- p k cyclic codes over rm GR (p 2 m)
|
# |
|
|
On Complementary-dual Quasi-cyclic Codes
|
# |
|
|
On Covering Radius of a Family of Codes CmU (1 Cm) with Maximum Distance Between Cm and 1 Cm
|
# |
|
|
Maximum-girth Slope-based Quasi-cyclic (2 k 5) Low-Ddensity Parity-Check Codes
|
# |
|
|
Covering Radius of Binary Codes having Parity-check Matrices with Constant-weight Columns
|
# |
|
|
Construction of Binary Minimal Product Parity-check matrices
|
# |
|
|
On the stopping distance and stopping redundancy of product codes
|
# |
|
|
On Full-rank Parity-check Matrices of Product Codes
|
# |
|