|
|
|
|
|
- R. Smarandache,
A. Pusane, P. O. Vontobel, D. J. Costello, Jr.: "Pseudo-codeword
Performance Analysis of LDPC convolutional codes",
IEEE Trans. Inform. Theory, in print.
http://arxiv.org/abs/cs.IT/0609148, Sept. 2006.
- R. Smarandache, P. O. Vontobel:
"New QC Codes From Old Based on Basic Protographs", in preparation.
-
A. Pusane, R. Smarandache, P. O. Vontobel, D. J. Costello, Jr.:
"Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes",
in preparation.
- R. Hutchinson, R. Smarandache, J.Trumpf: "Superregular Matrices and the Construction of Convolutional Codes having
a Maximum Distance Profile", submitted to
Linear Algebra and Its Applications.
http://www.arxiv.org/abs/cs.IT/0607089, July 2006.
- R. Smarandache and P. O. Vontobel: "Pseudo-codeword analysis of Tanner
graphs from projective and Euclidean planes", in IEEE Trans.
Inform. Theory, Volume 53, Issue 7, pp.~2376--2393,
July 2007.
http://www.arxiv.org/abs/cs.IT/0602089, Feb. 2006.
- R. Smarandache, M.
Wauer: "Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords
of Projective Geometry Codes", in Contemporary
Mathematics, Algebra and Its Applications, Vol. 419,
ISBN-10:0-8218-3842-3, Dec. 2006.
http://www.arxiv.org/abs/cs.IT/0510049.
- H. Gluesing-Luerssen,
J. Rosenthal, R. Smarandache: Strongly-MDS
Convolutional Codes. in IEEE Trans.
Inform. Theory, vol. 52, no. 2: 584--598, February, 2006.
- R. Hutchinson, J. Rosenthal,
R. Smarandache. Convolutional Codes
with Maximum Distance Profile. Systems and Control Letters, 4(1):53-63,
2005.
- R. Smarandache: Unit
memory convolutional codes with maximum distance. Codes, Systems
and Graphical Models, IMA Vol. 123: 381--396. Springer-Verlag
2000.
- R. Smarandache, H. Gluesing-Luerssen,
J.Rosenthal: Constructions
of MDS convolutional codes. IEEE Transaction in Information Theory,
July 2001, 2045-2050.
- J.Rosenthal, R. Smarandache:
Maximum distance
separable convolutional codes. Appl. Algebra Engrg. Comm. Comput.
10 (1999) p.: 15-32.
|
|
|
|
|
|
|
|
|
|
Articles in Refereed
Proceedings:
|
|
|
|
|
- A. E. Pusane, R. Smarandache, P. O. Vontobel, D. J. Costello, Jr.: On deriving
good LDPC convolutional codes from QC LDPC block codes. In Proc. IEEE Intern. Symp.on
Inform. Theory, (Nice France), June 24--29, 2007.
- R. Smarandache, A. Pusane, P. O. Vontobel, D. J. Costello, Jr.
: Pseudo-codewords in
LDPC convolutional codes. In Proc. IEEE Intern. Symp.on
Inform. Theory, (Seattle, USA), p. 1364--1368, July 9--14, 2006.
- P. O. Vontobel, R. Smarandache
: On
Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes. Proc.
of the Forty-Third Annual Allerton Conference on Communication, Control, and
Computing, Sept. 28-Oct. 2, 2005.
- P. O. Vontobel, R. Smarandache,
N. Kiyavash, J. Teutsch, D. Vukobratovic: On the Minimal Pseudo-Codewords of Codes from
Finite Geometries. Proc. of the 2005 IEEE International Symposium on
Information Theory, Adelaide, Australia, Sept. 4-9, 2005: 980-984.
- R. Smarandache, P. O. Vontobel: On regular quasi-cyclic LDPC codes from binomials.
Proc. of the 2004 IEEE International Symposium on Information
Theory, Chicago, 2004, page 274.
- M. Greferath, M. O'Sullivan, R. Smarandache: Construction of good LDPC codes using
dilation matrices. Proc. of the 2004 IEEE International Symposium on
Information Theory, Chicago, 2004, page 237.
- H . Gluesing-Luerssen, R. Hutchinson, J. Rosenthal, R.
Smarandache: Convolutional Codes which are Maximum Distance Separable and
which have a Maximum Distance Profile. Proc. of the 41-th Annual Allerton
Conference on Communication, Control, and Computing, October 2003.
- M. O'Sullivan, R. Smarandache:
High-rate, short length, (3,3s)-regular LDPC Codes of girth 6 and 8. Proceedings.
of the 2003 IEEE International Symposium on Information Theory Yokohama,
Japan, 2003.
- M. O'Sullivan, M. Greferath,
R. Smarandache: Construction of LDPC Codes from Affine Permutation Matrices
Proceedings of the 40th Annual Allerton Conference on Communication, Control,
and Computing, 2002.
- M. O'Sullivan, M. Greferath,
R. Smarandache: Analysis of Iterative Decoding Algorithms. Proceedings of
15th International Symposium on the Mathematical Theory of Networks and
Systems, August 2002, Notre Dame, IN.
- R. Smarandache, H. Gluesing-Luerssen,
J.Rosenthal: Construction and Decoding of Strongly MDS Convolutional Codes.
Proceedings of 15th International Symposium on the Mathematical Theory
of Networks and Systems, August 2002, Notre Dame, IN.
- R. Smarandache,
H. Gluesing-Luerssen, J. Rosenthal: Strongly MDS Convolutional Codes with
Maximal Decoding Capability.Proceedings. of the 2002 IEEE International
Symposium on Information Theory. Lausanne, Switzerland 2002.
- R. Smarandache, J. Rosenthal:
Construction Results for MDS-Convolutional Codes. Proceedings. of the 2000
IEEE International Symposium on Information Theory, Sorrento, Italy 2000.
p. 294.
- J. Rosenthal, R. Smarandache:
On the dual of MDS convolutional codes.. Proceedings. of the 36th Annual
Allerton Conference on Communication, Control, and Computing 1998, 576-583.
- R. Smarandache, J. Rosenthal:
Convolutional code constructions resulting in maximal or near maximal
free distance. Proceedings. of the 1998 IEEE International Symposium on
Information Theory, Bostan MA 1998, 308
- R. Smarandache, H. Gluesing-Luerssen,
J. Rosenthal: Generalized first order descriptions and canonical forms for
convolutional codes. In Mathematical Theory of Networks and Systems, A.
Beghi, L. Finesso and G. Picci, eds: Proceedings of the MTNS-98, Padova,
Italy 1998, 1091-1094.
- R. Smarandache, J. Rosenthal:
A state space approach for constructing MDS rate 1/n convolutional
codes. Proceedings of the 1998 IEEE Information Theory Workshop on Information
Theory Killarney, Ireland 1998, 116-117.
- J. Rosenthal, R. Smarandache:
Construction of convolutional codes using methods from linear system
theory. Proc. of the 35-th Annual Allerton Conference on Communication,
Control, and Computing 1997, 953--960
- J. Rosenthal, R. Smarandache:
Construction of convolutional codes using methods from linear system
theory. Proc. of the 35-th Annual Allerton Conference on Communication,
Control, and Computing 1997, 953--960.
|
|
