Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of calculating minimum-redundancy codes for alphabets in which there is significant repetition of symbol ights. On a sorted-by-ight alphabet of, n symbols and r distinct symbol ights  show that a minimum-redundancy prefix code can be constructed in O(r+r log(n/r)) time, and that a minimum redundancy L-bit length-limited prefix code can be constructed in O(Lr+Lrlog(n/r)) time. When r is small relative to n-which is necessarily the case for most practical coding problems on large alphabets-these bounds represent a substantial improvement upon the best previous algorithms for these two problems, which consumed O(n) time and O(nL) time, respectively. The improved algorithms are also space-efficient.
['Alistair Moffat', 'Andrew Turpin']
I am writing a research paper on a idea Efficient construction of minimum-redundancy codes for large alphabets
[{"from": "human", "value": "I am writing a research paper on a idea Efficient construction of minimum-redundancy codes for large alphabets"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of calculating minimum-redundancy codes for alphabets in which there is significant repetition of symbol ights. On a sorted-by-ight alphabet of, n symbols and r distinct symbol ights  show that a minimum-redundancy prefix code can be constructed in O(r+r log(n/r)) time, and that a minimum redundancy L-bit length-limited prefix code can be constructed in O(Lr+Lrlog(n/r)) time. When r is small relative to n-which is necessarily the case for most practical coding problems on large alphabets-these bounds represent a substantial improvement upon the best previous algorithms for these two problems, which consumed O(n) time and O(nL) time, respectively. The improved algorithms are also space-efficient."}]