A Different approach of Bloom Filters for Error Detection and Correction
B. Ramesh, G. Kishore Kumar
Bloom filters (BFs), error correction, soft errors
A Bloom Filter (BF) is a data structure compatible for performing set membership queries very effectively. A standard BloomFilter representing a set of n elements is generated by using an array of m bits and uses k unbiased hash functions. Bloom Filters have some attractive properties together with low storage requirement, fast membership checking and no false negatives. False positives are viable however their probability is also managed and significantly lowered depending upon the application standards.Our maincontributions are exploring the design space andthe evaluation of a series of extensions (1) toincrease the practicality and performanceof iBFs, (2) to enable false-negative-free elementdeletion, and (3) to provide securityenhancements..The proposed scheme may also be of interest in useful designs to without difficultymitigate mistakes with a lowered overhead in terms of circuit area and power.
Article Details
Unique Paper ID: 144340

Publication Volume & Issue: Volume 2, Issue 9

Page(s): 152 - 155
Article Preview & Download

Share This Article

Conference Alert


AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2021

SWEC- Management


Last Date: 7th November 2021

Go To Issue

Call For Paper

Volume 8 Issue 4

Last Date 25 September 2021

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Email: editor@ijirt.org
Website: ijirt.org