Vinod Tyagi

Available identifiers

Publication	Date of Publication	Type
Repeated Burst Error Correcting Linear Codes Over GF(q); q = 3	2020-06-29	Paper
bi-Byte correcting non-binary perfect codes	2019-05-07	Paper
Restricted bi-byte correcting non-binary optimal codes	2019-05-07	Paper
Restricted 2-burst-correcting non-binary optimal codes	2018-09-17	Paper
Byte protecting perfect burst code	2017-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q5506619	2016-12-12	Paper
New construction technique for \(q\)-ary Hamming codes for \(r = 2\), \(q\geq 3\)	2016-07-20	Paper
\(b_i\)-byte correcting perfect codes	2014-05-21	Paper
New class of double inductive error correcting codes based on the class of GRM and DGRM codes over \(\mathrm{GF}(2)\)	2014-04-25	Paper
\(\mathbb Z_4\)-linear GRM codes	2014-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q5327031	2013-08-01	Paper
Reversible and \((n_1,n_2)\)-blockwise reversible code	2012-09-12	Paper
New construction of GRM codes	2012-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q3009577	2011-06-24	Paper
\(b\)-SBEC cyclic codes	2011-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q3007221	2011-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q3809722	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3734311	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3701330	1983-01-01	Paper
A new type of \((1,2)\)-optimal codes over \(\mathrm{GF}(2)\)	1982-01-01	Paper
An upper bound for codes detecting low-density closed-loop bursts	1981-01-01	Paper
Bounds on blockwise burst error correcting linear codes	1980-01-01	Paper

This page was built for person: Vinod Tyagi