Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let finite source and reproduction alphabets X and Y and a distortion measure d: X/spl times/Y/spl rarr/[0,/spl infin/) be given.  study the minimum asymptotic rate required to describe a source distributed over X within a (given) distortion threshold D at every sample. The problem is hence a min-max problem, and the distortion measure is extended to vectors as follows: for x/sup n//spl isin/X/sup n/, y/sup n//spl isin/Y/sup n/, d(x/sup n/, y/sup n/)=max/sub i/d(x/sub i/, y/sub i/). In the graph-theoretic formulation  introduce, a code for the problem is a dominating set of an equivalent distortion graph.  introduce a linear programming lor bound for the minimum dominating set size of an arbitrary graph, and show that this bound is also the minimum asymptotic rate required for the corresponding source. Turning then to the optimality of scalar coding,  show that scalar codes are asymptotically optimal if the underlying graph is either an interval graph or a tree.
['Ertem Tuncel', 'Prashant Koulgi', 'Shankar L. Regunathan', 'Kenneth Rose']
I am writing a research paper on a idea Zero-error source coding with maximum distortion criterion
[{"from": "human", "value": "I am writing a research paper on a idea Zero-error source coding with maximum distortion criterion"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let finite source and reproduction alphabets X and Y and a distortion measure d: X/spl times/Y/spl rarr/[0,/spl infin/) be given.  study the minimum asymptotic rate required to describe a source distributed over X within a (given) distortion threshold D at every sample. The problem is hence a min-max problem, and the distortion measure is extended to vectors as follows: for x/sup n//spl isin/X/sup n/, y/sup n//spl isin/Y/sup n/, d(x/sup n/, y/sup n/)=max/sub i/d(x/sub i/, y/sub i/). In the graph-theoretic formulation  introduce, a code for the problem is a dominating set of an equivalent distortion graph.  introduce a linear programming lor bound for the minimum dominating set size of an arbitrary graph, and show that this bound is also the minimum asymptotic rate required for the corresponding source. Turning then to the optimality of scalar coding,  show that scalar codes are asymptotically optimal if the underlying graph is either an interval graph or a tree."}]