Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Random coding performance bounds for  L -list permutation invariant binary linear block codes transmitted over output symmetric channels are presented. Under list decoding, double and single exponential bounds are deduced by considering permutation ensembles of the above codes and exploiting the concavity of the double exponential function over the region of erroneous received vectors. The proposed technique specifies fixed list sizes  L  for specific codes under which the corresponding list decoding error probability approaches zero in a double exponential manner. The single exponential bound constitutes a generalization of Shulman-Feder bound and allows the treatment of codes with rates below the cutoff limit. Numerical examples of the new bounds for the specific category of codes are presented.
['Kostis Xenoulis', 'Nicholas Kalouptsidis']
I am writing a research paper on a idea Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels
[{"from": "human", "value": "I am writing a research paper on a idea Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Random coding performance bounds for  L -list permutation invariant binary linear block codes transmitted over output symmetric channels are presented. Under list decoding, double and single exponential bounds are deduced by considering permutation ensembles of the above codes and exploiting the concavity of the double exponential function over the region of erroneous received vectors. The proposed technique specifies fixed list sizes  L  for specific codes under which the corresponding list decoding error probability approaches zero in a double exponential manner. The single exponential bound constitutes a generalization of Shulman-Feder bound and allows the treatment of codes with rates below the cutoff limit. Numerical examples of the new bounds for the specific category of codes are presented."}]