Enhanced random access transmission

1. An apparatus, comprising:

a processor; and

a memory including computer program code,

the memory and the computer program code configured to, with the processor, cause the apparatus at least to

provide a message of a first time period L;

divide the message into N self-decodable blocks, and

transmit the N self-decodable blocks towards a communications network, wherein the transmitter is further configured to form N incremental redundancy versions of the message, where the number of self-decodable blocks equals the number of incremental redundancy versions, and convert the N incremental redundancy versions of the message to the N self-decodable blocks each having a second time period l n , and wherein

∑

n

=

1

N

⁢

l

n

≤

L

.

2. An apparatus according to claim 1 , wherein the apparatus is further configured to weigh a transmission power of at least one self-decodable block of the N self-decodable blocks.

3. An apparatus according to claim 1 , wherein the apparatus is further configured to transmit the N self-decodable blocks in a random access transmission.

4. An apparatus according to claim 1 , wherein the apparatus comprises a mobile terminal.

5. An apparatus, comprising:

a processor; and

a memory including computer program code,

the memory and the computer program code configured to, with the processor, cause the apparatus at least to

provide a message of a first time period L,

divide the message into N self-decodable blocks, and

transmit the N self-decodable blocks towards a communications network, wherein the transmitter is further configured to duplicate the message N times to obtain N duplicated messages, where the number of self-decodable blocks equals the number of duplicated messages, and to convert the N duplicated messages to the N self-decodable blocks each having a second time period l n =L/N.

6. An apparatus according to claim 5 , wherein the apparatus is further configured to weigh a transmission power of at least one self-decodable block of the N self-decodable blocks.

7. An apparatus according to claim 5 , wherein the apparatus is further configured to transmit the N self-decodable blocks in a random access transmission.

8. An apparatus according to claim 5 , wherein the apparatus comprises a mobile terminal.

9. An apparatus, comprising:

a processor; and

a memory including computer program code,

the memory and the computer program code configured to, with the processor, cause the apparatus at least to

detect at least one block of N blocks of a message, said at least one block being less than N blocks,

decode the at least one block of the N blocks to obtain the message, and

combine at least two blocks of the N blocks before said decoding.

10. An apparatus according to claim 9 , wherein the apparatus is further configured to detect the at least one block of the N blocks within an interval corresponding to a time period of the message.

11. An apparatus according to claim 9 , wherein the apparatus is further configured to detect the at least one block of the N blocks from a random access transmission.

12. An apparatus according to claim 9 , wherein the apparatus comprises a base station of a communications network.

13. A method, comprising:

providing a message of a first time period L at a transmitter;

dividing the message into N self-decodable blocks; and

transmitting the N self-decodable blocks via the transmitter towards a communications network wherein the dividing comprises forming N incremental redundancy versions of the message, where the number of self-decodable blocks equals the number of incremental redundancy versions, and converting the N incremental redundancy versions of the message to the N self-decodable blocks each having a second time period l n , and

wherein

∑

n

=

1

N

⁢

⁢

l

n

≤

L

.

14. A method according to claim 13 , further comprising:

weighting a transmission power of at least one self-decodable block of the N self-decodable blocks.

15. A method according to claim 13 , wherein, in the transmitting, the N self-decodable blocks are transmitted in a random access transmission.

16. A method, comprising:

providing a message of a first time period L at a transmitter;

dividing the message into N self-decodable blocks; and

transmitting the N self-decodable blocks via the transmitter towards a communications network, wherein the dividing comprises duplicating the message N times to obtain N duplicated messages, where the number of self-decodable blocks equals the number of duplicated messages, and converting the N duplicated messages to the N self-decodable blocks each having a second time period l n =L/N.

17. A method according to claim 16 , further comprising:

weighting a transmission power of at least one self-decodable block of the N self-decodable blocks.

18. A method according to claim 16 , wherein, in the transmitting, the N self-decodable blocks are transmitted in a random access transmission.

19. A method, comprising:

detecting at least one block of N blocks of a message at a receiver, said at least one block being less than N blocks;

decoding the at least one block of the N blocks to obtain the message via the receiver; and

combining at least two blocks of the N blocks before decoding is performed.

20. A method according to claim 19 , wherein, in the detecting, the at least one block of the N blocks is detected within an interval corresponding to a time period of the message.

21. A method according to claim 19 , wherein, in the detecting, the at least one block of the N blocks is detected from a random access transmission.

22. A computer program embodied on a computer-readable medium, the computer program configured to control a processor to perform a process, the process comprising:

providing a message of a first time period L at a transmitter;

dividing the message into N self-decodable blocks; and

transmitting the N self-decodable blocks via a transmitter towards a communications network wherein the dividing comprises forming N incremental redundancy versions of the message, where the number of self-decodable blocks equals the number of incremental redundancy versions, and converting the N incremental redundancy versions of the message to the N self-decodable blocks each having a second time period l n , and

wherein

∑

n

=

1

N

⁢

⁢

l

n

≤

L

.

23. The computer program according to claim 22 , wherein the computer program is directly loadable into an internal memory of a computer.

24. A computer program according to claim 22 , the process further comprising:

weighting a transmission power of at least one self-decodable block of the N self-decodable blocks.

25. A computer program according to claim 22 , wherein, in the transmitting, the N self-decodable blocks are transmitted in a random access transmission.

26. A computer program embodied on a computer-readable medium, the computer program configured to control a processor to perform a process, the process comprising:

detecting at least one block of N blocks of a message at a receiver, said at least one block being less than N blocks;

decoding the at least one block of the N blocks for obtaining the message via the receiver; and

combining at least two blocks of the N blocks before decoding is performed.

27. A computer program according to claim 26 , wherein, in the detecting, the at least one block of the N blocks is detected within an interval corresponding to a time period of the message.

28. A computer program according to claim 26 , wherein, in the detecting, the at least one block of the N blocks is detected from a random access transmission.

29. An apparatus, comprising:

providing means for providing a message of a first time period L;

dividing means for dividing the message into N self-decodable blocks; and

transmitting means for transmitting the N self-decodable blocks towards a communications network, wherein the dividing means comprises

forming means for forming N incremental redundancy versions of the message, where the number of self-decodable blocks equals the number of incremental redundancy versions, and

converting means for converting the N incremental redundancy versions of the message to the N self-decodable blocks each having a second time period l n , and

wherein

∑

n

=

1

N

⁢

⁢

l

n

≤

L

.

30. An apparatus, comprising:

providing means for providing a message of a first time period L;

dividing means for dividing the message into N self-decodable blocks; and

transmitting means for transmitting the N self-decodable blocks towards a communications network, wherein the dividing means comprises

duplicating means for duplicating the message N times to obtain N duplicated messages, where the number of self-decodable blocks equals the number of incremental redundancy versions, and

converting means for converting the N duplicated messages to the N self-decodable blocks each having a second time period l n =L/N.

31. An apparatus, comprising:

detecting means for detecting at least one block of N blocks of a message, said at least one block being less than N blocks;

decoding means for decoding the at least one block of the N blocks to obtain the message; and

combining means for combining at least two blocks of the N blocks before said decoding.

32. A computer program embodied on a computer-readable medium, the computer program configured to control a processor to perform a process, the process comprising:

providing a message of a first time period L at a transmitter;

dividing the message into N self-decodable blocks; and

transmitting the N self-decodable blocks via the transmitter towards a communications network, wherein the dividing comprises duplicating the message N times to obtain N duplicated messages, where the number of self-decodable blocks equals the number of duplicated messages, and converting the N duplicated messages to the N self-decodable blocks each having a second time period l n =L/N.

33. A computer program according to claim 32 , the process further comprising:

weighting a transmission power of at least one self-decodable block of the N self-decodable blocks.

34. A computer program according to claim 32 , wherein, in the transmitting, the N self-decodable blocks are transmitted in a random access transmission.