Vinod Tyagi

According to our database, Vinod Tyagi authored at least 7 papers between 1980 and 2019.

Collaborative distances:

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

2019

Restricted bi-byte correcting non-binary optimal codes.

Vinod Tyagi, Tarun Lata

Discret. Math. Algorithms Appl., 2019

bi-Byte correcting non-binary perfect codes.

Vinod Tyagi, Tarun Lata

Discret. Math. Algorithms Appl., 2019

2018

Repeated Burst Error Correcting Linear Codes Over GF(q); q = 3.

Vinod Tyagi, Subodh Kumar

Proceedings of the Mathematics and Computing - 4th International Conference, 2018

2017

Byte protecting perfect burst code.

Vinod Tyagi, Ambika Tyagi

Discret. Math. Algorithms Appl., 2017

2014

New Class of Double Inductive error Correcting codes Based on the Class of GRM and Dgrm codes over GF(2).

Seema Thakran, Vinod Tyagi

Discret. Math. Algorithms Appl., 2014

1981

An upper bound for codes detecting low-density closed-loop bursts.

Sunil Kumar Muttoo, Vinod Tyagi

Inf. Sci., 1981

1980

Bounds on blockwise burst error correcting linear codes.

Bal Kishan Dass, Vinod Tyagi

Inf. Sci., 1980