Bal Kishan Dass

According to our database1, Bal Kishan Dass authored at least 22 papers between 1974 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Survey on SAP and its application in public-key cryptography.
J. Math. Cryptol., 2020

MDS and <i>I</i>-perfect poset block codes.
Finite Fields Their Appl., 2020

2019
MGR Hash Functions.
Cryptologia, 2019

2018
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces.
Adv. Math. Commun., 2018

2017
Perfect codes in poset spaces and poset block spaces.
Finite Fields Their Appl., 2017

2016
Multi-stage Optional Unrelated Question RRT Model.
J. Stat. Theory Appl., 2016

A Maiorana-McFarland Construction of a GBF on Galois ring.
IACR Cryptol. ePrint Arch., 2016

Neeva: A Lightweight Hash Function.
IACR Cryptol. ePrint Arch., 2016

Undeniable signature scheme based over group ring.
Appl. Algebra Eng. Commun. Comput., 2016

2015
MGR HASH FUNCTION.
IACR Cryptol. ePrint Arch., 2015

The packing radius of a poset block code.
Discret. Math. Algorithms Appl., 2015

2012
Construction of M-Repeated Burst Error Correcting Binary Linear Code.
Discret. Math. Algorithms Appl., 2012

Bounds for Codes Correcting/Detecting repeated Low-Density Burst Errors.
Discret. Math. Algorithms Appl., 2012

2010
Repeated Burst Error Locating Linear Codes.
Discret. Math. Algorithms Appl., 2010

1983
Burst Distribution of a Linear Code.
J. Comb. Theory A, 1983

1981
Comments on 'Error-locating codes - A new concept in error control' by J. K. Wolf and B. Elspas.
IEEE Trans. Inf. Theory, 1981

1980
Bounds on blockwise burst error correcting linear codes.
Inf. Sci., 1980

A bound for random and closed loop burst error detecting codes.
Inf. Sci., 1980

A note on Reed-Muller codes.
Discret. Appl. Math., 1980

1975
Correction to 'Extended Varshamov-Gilbert and Sphere-Packing bounds for Burst-Correcting Codes'.
IEEE Trans. Inf. Theory, 1975

A Sufficient Bound for Codes Correcting Bursts with Weight Constraint.
J. ACM, 1975

1974
Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.).
IEEE Trans. Inf. Theory, 1974


  Loading...