default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBal Kishan Dass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j19]Bal Kishan Dass, Namita Sharma, Rashmi Verma:
MDS and I-perfect poset block codes. Finite Fields Their Appl. 62: 101620 (2020)- [j18]Neha Goel, Indivar Gupta, Bal Kishan Dass:
Survey on SAP and its application in public-key cryptography. J. Math. Cryptol. 14(1): 144-152 (2020)
2010 – 2019
- 2019
- [j17]Khushboo Bussi, Dhananjoy Dey
, Prasanna Raghaw Mishra, Bal Kishan Dass:
MGR Hash Functions. Cryptologia 43(5): 372-390 (2019) - 2018
- [j16]Bal Kishan Dass, Namita Sharma, Rashmi Verma:
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces. Adv. Math. Commun. 12(4): 629-639 (2018) - 2017
- [j15]Bal Kishan Dass, Namita Sharma, Rashmi Verma:
Perfect codes in poset spaces and poset block spaces. Finite Fields Their Appl. 46: 90-106 (2017) - 2016
- [j14]Neha Goel, Indivar Gupta, M. K. Dubey, Bal Kishan Dass:
Undeniable signature scheme based over group ring. Appl. Algebra Eng. Commun. Comput. 27(6): 523-535 (2016) - [j13]Anu Chhabra, Bal Kishan Dass, Samridhi Mehta:
Multi-stage Optional Unrelated Question RRT Model. J. Stat. Theory Appl. 15(1): 80-95 (2016) - [i3]Khushboo Bussi, Dhananjoy Dey, Manoj Kumar Biswas, Bal Kishan Dass:
Neeva: A Lightweight Hash Function. IACR Cryptol. ePrint Arch. 2016: 42 (2016) - [i2]Shashi Kant Pandey, Prasanna Raghaw Mishra, Bal Kishan Dass:
A Maiorana-McFarland Construction of a GBF on Galois ring. IACR Cryptol. ePrint Arch. 2016: 97 (2016) - 2015
- [j12]Bal Kishan Dass, Namita Sharma, Rashmi Verma:
The packing radius of a poset block code. Discret. Math. Algorithms Appl. 7(4): 1550045:1-1550045:10 (2015) - [i1]Khushboo Bussi, Dhananjoy Dey, Prasanna Raghaw Mishra, Bal Kishan Dass:
MGR HASH FUNCTION. IACR Cryptol. ePrint Arch. 2015: 856 (2015) - 2012
- [j11]Bal Kishan Dass, Rashmi Verma:
Construction of M-Repeated Burst Error Correcting Binary Linear Code. Discret. Math. Algorithms Appl. 4(3) (2012) - [j10]Bal Kishan Dass, Poonam Garg:
Bounds for Codes Correcting/Detecting repeated Low-Density Burst Errors. Discret. Math. Algorithms Appl. 4(4) (2012) - 2010
- [j9]Bal Kishan Dass, Surbhi Madan:
Repeated Burst Error Locating Linear Codes. Discret. Math. Algorithms Appl. 2(2): 181-188 (2010)
1980 – 1989
- 1983
- [j8]Bal Kishan Dass, Siri Krishan Wasan, Arthur L. Rubin:
Burst Distribution of a Linear Code. J. Comb. Theory A 34(1): 94-97 (1983) - 1981
- [j7]Bal Kishan Dass, Sunil Kumar Muttoo:
Comments on 'Error-locating codes - A new concept in error control' by J. K. Wolf and B. Elspas. IEEE Trans. Inf. Theory 27(1): 136- (1981) - 1980
- [j6]Bal Kishan Dass, Sunil Kumar Muttoo:
A note on Reed-Muller codes. Discret. Appl. Math. 2(4): 345-348 (1980) - [j5]Bal Kishan Dass, Sunil Kumar Muttoo:
A bound for random and closed loop burst error detecting codes. Inf. Sci. 20(2): 151-156 (1980) - [j4]Bal Kishan Dass, Vinod Tyagi:
Bounds on blockwise burst error correcting linear codes. Inf. Sci. 20(3): 157-164 (1980)
1970 – 1979
- 1975
- [j3]Bal Kishan Dass:
A Sufficient Bound for Codes Correcting Bursts with Weight Constraint. J. ACM 22(4): 501-503 (1975) - [j2]Bhu Dev Sharma, Bal Kishan Dass:
Correction to 'Extended Varshamov-Gilbert and Sphere-Packing bounds for Burst-Correcting Codes'. IEEE Trans. Inf. Theory 21(1): 115 (1975) - 1974
- [j1]Bhu Dev Sharma, Bal Kishan Dass:
Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.). IEEE Trans. Inf. Theory 20(2): 291-292 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
