Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM64953
Volume:
10 |
6 |
Jun 2026
Pages:
1-6
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Department of Mathematics
Government Degree College Baramulla Kashmir. J&K.
Department of Statistics
Goverment College for Women, M.A Road Srinagar Kashmir. J&K.
Codes of variable length that are capable of error correction are studied. A lower bound on , the generalized mean length of such codes under the criterion of “promptness” is obtained. This generalizes the result due to Bernard and Sharma [5] and Baig and Zaheeruddin [4] for noisy channels. Also this generalizes the result due to Kerridge [9], which itself is a generalization of celebrated result due to Shannon [12] for noiseless channel. The bound obtained provides a measure of optimality for variable length error correcting codes.
KEYWORDS
It is well known that a lower bound on the average length is obtained in terms of Shannon entropy [12] for instantaneous codes in noiseless channel (Abramson [1] ). Bernard and Sharma [6] studied variable length codes for noisy channels and presented some combinatorial bounds for these variable length, error correcting codes. Bernard and Sharma [5] obtained a lower bound on average length for variable length error correcting codes satisfying the criterion of “promptness”. In this paper a lower bound of generalized code length of order and type for variable length error correcting codes is obtained in terms of a measure similar to that of ‘useful’ inaccuracy of order and type given by Tuteja and Bhaker [14]. This generalizes the result due to Bernard and Sharma [5], Baig and Zaheeruddin [4] and well known Shannon’s inequality.
(1) Abramson, N, “Information theory and coding” McGraw Hill, New York (1963). (2) Autar, R and Soni, R.S, “Inaccuracy and coding theorem,” Journal of Applied probability, 12, 845-851(1975). (3) Baig, M.A.K and Zaheeruddin, “ Coding theorem and a measure of inaccuracy”, Soochow Journal of Mathematics, 19(4), 1-7 (1993). (4) Bernard, M and Sharma, B.D,“A Lower bound on average code word length of variable length error correcting codes”, IEEE Transaction on Information theory,36(6), 1474-1745 (1990). (5) Bernard, M and Sharma, B.D, “Some combinatorial results on variable length error correcting codes”, ARS Combinatoria, 25(B), 181-194 (1988). (6) Hamming, R.W, “Error detecting and error correcting codes”, Bell System Tech. Journal 29, 147-160 (1950). (7) Hartnett, W.E(ed), “Foundation of coding theory” D.Reidling Publishing Co., Dordietcht, Holland, 1974. (8) Kerridge, D.F, “Inaccuracy and Inference”, Journal of Royal Statistical Society B, 23, 184-194 (1961). (10)Kraft, L.J,“A device for quantizing grouping and coding amptitude modulated pulses”, M.S Thesis Electrical Engineering Department Massach Institute of Technology, 1949.
Publication Date
6/14/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
3
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...