Abstract
Forensic science (or forensics) is the quisling of sciences and technologies to enquire and demonstrate facts of interest in relation to criminal or civil law. Although forensics has greatly enhanced investigators’ ability to unriddle crimes, limitations are still there to be audited in and out of the courtroom in order to avoid wrongful convictions. Definition and establishment of likelihood ratio (LR) is one of the Computational methods that can be applied in the forensic sciences to increase the efficiency and effectiveness of forensic casework. It can be quite logical to apply sum product algorithm used in the case of decoding of Low density Parity check code for calculating Log-likelihood ratio (LLR), which in turn will be more effective than LR calculation in case of more effective error analysis. This theoretical endeavor explores this effort.
Acknowledgements
The corresponding author would like to thank Venkata Udaya Sameer B and Rahul Dixit of CSE Department of NIT, Rourkela for providing their support in this work. Venkata Udaya Sameer B is working in the research area of source camera verification and Rahul Dixit is working in copy-move forgery detection.
Additional information
Notes on contributors
Madhusmita Mishra
Madhusmita Mishra received her BE in electronics and communication engineering from Utkal University, Orissa in 1997. She creditably completed her ME in communication control and networking from RGPV, Bhopal in 2005. She is serving the National Institute of Technology-Rourkela, India as a research scholar in the Department of Electronics and Communication Engineering. Her specialization is focused on LDPC-coded communication system design. She has published 10 scholarly articles and one book. Previously she was an assistant professor in Electronics and Telecommunication department of Ajay Binay Institute of technology. Currently she is an assistant professor in the ECE department of Madanapalle Institute of Technology & Science, Andhra Pradesh, India. Corresponding author. Email: [email protected]