Dear Colleagues,

welcome,

I asked a similar question on researchgate and there is a discussion on this topic.

Real communication systems can approach the shanon capacity limit by using turbocoding where the turbocoding extends the randomness of codes to long sequences.

It is so that in order to achieve the shanon capacity of a communication channel one has to use very large dimensional symbols which means very large number of bits per symbol.

For more discussion please refer to link: https://www.researchgate.net/post/The_shanon_capacity_limit_of_a_communication_channel_how_to_approach_it_practically

Best wishes

Shannon capacity of the channel would assume that data with certain signal to noise ratio is being transmitted continuously and no delay is involved except for propagation delay. I assume that for small packets due to other delays (which he mentions in “INTRODUCTION” para 2 computing plus coding) and because of retransmission of lost packets, the effective data transmission rate will not meet Shannon capacity.

Thanks a lots Muhammad Amin for your interesting and your answer, but i think as the paper shows that for short length data packet transmission, the finite length channel codes will not guarantee the error-free transmission and a new techniques must be proposed to overcome the transmission error resulting from the short packet length transmission.

Dear Colleagues,

welcome,

I asked a similar question on researchgate and there is a discussion on this topic.

Real communication systems can approach the shanon capacity limit by using turbocoding where the turbocoding extends the randomness of codes to long sequences.

It is so that in order to achieve the shanon capacity of a communication channel one has to use very large dimensional symbols which means very large number of bits per symbol.

For more discussion please refer to link: https://www.researchgate.net/post/The_shanon_capacity_limit_of_a_communication_channel_how_to_approach_it_practically

Best wishes

Dear Prof. Dr. Zekry

Thanks a lots for your answer. I have surveyed your referred previous discussion and found it beneficial. According my last reading, I find that the Shannon formula is only applied if the transmission error is guaranteed to be zero, this can be satisfied for long packet transmission but by introducing the new use cases of short packet transmission as in MTC, the transmission error is not guaranteed to be zero and a new formula must be established. In the ref.[5] of the paper in my question, a detailed review of the advancements in the theory of the short packet communications, Also it suggested a new formula for the maximum achievable rate. This paper is attached to my comment.

Some of the reasons are simple and practical, such as bandwidth used up while ramping a transmitter up and down for a short packet, use of channel time to extract bit clock information, start/stop bits, and other housekeeping, which become a larger percentage of the non-payload time, or from a payload data perspective "noise", the shorter a packet is.