
News:
20132016


NSF Grant DMS1313221, The
mathematics of pseudocodewords,
(PI, 20132017).

20122015


NSF CIFAward on Spatially
Coupled Sparse Codes on Graphs: Theory,
Practice, and Extensions (PI,
20122016; collaborative research with EE,
Notre Dame, UCLA, New Mexico).

20082011


NSF CCFAward on New
Directions in GraphBased Code Design
(PI, 20082012; collaborative research with
EE, Notre Dame).

20072010


NSF DMSAward on PseudoCodeword
Analysis and Design of QuasiCyclic and
Convolutional Codes (PI, 20072011).

20142017


Editorial board for the IEEE
Transactions in Information Theory


20132014 

Editorial
board for the Advances
in Mathematics of Communications (AMC)
journal.

2016


Constructing
stronglyMDS convolutional codes with
maximum distance profile. D.
Napp and R. Smarandache, Advances in
Mathematics of Communications AMC, Vol.
10, no. 2, pp. 275290, 2016.

2014 

QuasiCyclic LDPC Codes
Based on Prelifted Protographs. D.
G. M. Mitchell, R. Smarandache, and D. J.
Costello, Jr., IEEE Trans. Inform.
Theory, Vol. 60 (10), pp. 58565874, 2014. 
2014 

Spatially Coupled Sparse
Codes on Graphs  Theory and Practice. D.
J. Costello, Jr., L. Dolecek, T. E. Fuja, J.
Kliewer, D. G. M. Mitchell, and R. Smarandache,
IEEE Communications Magazine, Vol. 52 (7), pp.
168176, 2014.

2013 

Diversity
Polynomials for the Analysis of Temporal
Correlations in Wireless Networks. M.
Haenggi and R. Smarandache, IEEE Trans. on
Wireless Comm., Vol. 12 (11), pp. 59405951,
2013.

Teaching:
EE 30363 Random Phenomena in Electrical Engineering
(Spring 2016)
MATH 1036006 Calculus B (Spring 2016)
MATH 30310 Undergraduate Coding Theory (Fall
2015)
EE 30363 Random Phenomena in Electrical
Engineering (Spring 2014)
MATH 30310 Undergraduate Coding Theory (Fall
2013)
MATH
10550 Calculus I (Fall 2013)
MATH
87500 Coding Theory (Spring 2013)
EE 80654 Coding Theory (Fall 2012)
MATH 10260 Elements of Calculus II (Spring 2006)
MATH 40210 Basic Combinatorics (Fall 2005)
MATH 10250 Elements of Calculus I (Fall 2005)
Publications
CV
Research Projects:
Dr. Smarandache's research topics are mainly related
to coding
theory.

The research projects are within or at the
intersection of these fields:
Coding Theory
Combinatorics
Graph Theory
Network coding, index coding, coding for
storage




Current
topics/graduate projects and links to
some papers:
Properties of Bethepermanents of matrices:
approximating permanents of matrices (permanents
are like determinants but the addition is
without the alternating sign) [pdf][pdf]
Interference and the diversity polynomial [pdf]
LDPC codes: algebraic and combinatorial
approaches [pdf] [pdf]
Spatially coupled LDPC codes: design
and decoding issues [pdf] [pdf]
Pseudocodewords, trapping sets and
absorbing sets for LDPC codes:
designing codes with predictable low error floor[pdf]
[pdf]
[pdf]
Convolutional codes with large distance (over
large finite fields): constructions [pdf] [pdf][pdf][pdf] [pdf]
[pdf]
[pdf]
and decoding over the erasure channel[pdf].
Linear programming: pseudocodewords and
connection to compressed sensing [pdf]
Algebraic combinatorics and graph theory:
distance bounds from eigenvalues of the
adjacency matrix [pdf]


Research problems:
The theory of error correcting codes offers a
large number of exciting research problems in
applied mathematics and theoretical
engineering, which makes this area appealing
to both mathematicians who would
like to see their ideas and
research being actually applied and
theoretically minded engineers.

What
is coding theory:
The field of coding theory is an applied
mathematical field that makes use of
classical and modern algebraic techniques involving
finite fields, discrete mathematics, group
theory, polynomial algebra, combinatorics,
probability, algebraic geometry, or number
theory (depending on the research
directions) to solve applied problems in
telecommunications.
It deals with the design of
errorcorrecting
codes, which are sets of vectors of a certain
given length chosen according to some desired
algebraic or probabilistic rules to allow for the
reliable transmission of information across noisy
channels.
Errorcorrecting codes are an integral component of
all communication systems currently in operation:
 CD, DVD, Bluray players and computer hard
drives are protected from errors by ReedSolomon
codes (these are sets of all polynomials having
roots some consecutive powers of a primitive element
of a given field);
 communication with deepspace missions depends
crucially on LDPC codes (these are kernels of a very
sparse binary matrices), and
 transmission over fiberoptic cables would not
be possible without a number of codes (discussed in
any coding course).
