I. M. Boyarinov

According to our database, I. M. Boyarinov authored at least 6 papers between 1981 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2013

Three-dimensional cyclic Fire codes.

I. M. Boyarinov

Des. Codes Cryptogr., 2013

2008

Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over <i>GF</i>(2^<i>m</i>).

I. M. Boyarinov

Probl. Inf. Transm., 2008

2006

Two-dimensional array codes correcting rectangular burst errors.

I. M. Boyarinov

Probl. Inf. Transm., 2006

2001

A Class of Composite Codes with Minimum Distance 8.

I. M. Boyarinov, Ian Martin, Bahram Honary

Probl. Inf. Transm., 2001

1993

Self-Checking Decoding Algorithm for Reed-Solomon Codes.

I. M. Boyarinov

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1981

Linear unequal error protection codes.

I. M. Boyarinov, G. L. Katsman

IEEE Trans. Inf. Theory, 1981