A Huffman Codes Based Approach to Achieve Minimum Redundancy

A Huffman Codes Based Approach to Achieve Minimum Redundancy

In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy `r' of any discrete memory less source satisfied r¿1-H(P N ), where PN is the lea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bhullar, J.S., Sandhu, P.S., Gupta, M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Binary codes
component
Computational modeling
Computer simulation
Educational institutions
Entropy
formatting
insert
style
styling
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy `r' of any discrete memory less source satisfied r¿1-H(P N ), where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.
DOI:10.1109/ICCMS.2010.177