Abstract: The present disclosure relates to a device for generating a polar code xN of length N and dimension K on the basis of a transformation matrix GN of size N×N, wherein the transformation matrix GN is based on a first matrix GN, of size Nr×N, and on a second matrix GNd of size Nd×Nd, wherein N=Nr·Nd, and wherein the polar code xN is given by xN=uN·GN, wherein uN=(u0, . . . uN-1) is a vector of size N, an element ui, i=0, . . . N?1, of the vector corresponding to an information bit if i?I, I being a set of K information bit indices, and ui=0, if i?F, F being a set of N?K frozen bit indices.

Abstract: Encoding of information bit sequences by use of an encoding device having more than two encoding entities is provided. Decoding of output codewords by a decoding device having more than two decoding entities is further provided. The encoding and the decoding are implemented through transmitting output codewords, generated by the encoding device, to the decoding device via a channel, wherein two or more user devices transmit the respective output codewords concurrently via the channel.

Abstract: A method for generating a polar code cN of length N and dimension K, on the basis of a generator matrix GN of size N×N, is provided. The method includes generating a distance spectrum vector dTp=(dTp(1), . . . , dTp(p)) of size p of the kernel Tp, wherein dTp(h), h=1, . . . , p, corresponds to a maximum value among all possible minimum distances of all possible polar codes of size p and dimension h generated on the basis of the kernel Tp. The method also includes generating a distance spectrum vector dGN of size N of the generator matrix GN on the basis of the distance spectrum vector dTp, determining the set of K information bit indices I on the basis of the distance spectrum vector dGN, and generating the polar code cN on the basis of the set of K information bit indices I.

Abstract: The present disclosure relates to a device for generating a polar code xN of length N and dimension K on the basis of a transformation matrix GN of size N×N, wherein the transformation matrix GN is based on a first matrix GN, of size Nr×N, and on a second matrix GNd of size Nd×Nd, wherein N=Nr·Nd, and wherein the polar code xN is given by xN=uN·GN, wherein uN=(u0, . . . uN-1) is a vector of size N, an element ui, i=0, . . . N?1, of the vector corresponding to an information bit if i?I, I being a set of K information bit indices, and ui=0, if i?F, F being a set of N?K frozen bit indices.

Abstract: An encoder for encoding K information bits into a code word of length N? on the basis of a polar code of length N is provided, wherein N is a power of 2 and greater than or equal to N?. The encoder comprises a memory storing a plurality of bit indices, which comprise a set of N frozen bit indices associated with the polar code of length N, a set of N/2 puncturing bit indices and/or a set of N/2 shortening bit indices and a processor configured to retrieve at least a subset of the plurality of bit indices from the memory, to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to the length N? for obtaining the code word of length N?.

Abstract: A method for generating a polar code cN of length N and dimension K, on the basis of a generator matrix GN of size N×N, is provided. The method includes generating a distance spectrum vector dTp=(dTp(1), . . . , dTp(p)) of size p of the kernel Tp, wherein dTp(h),h=1, . . . , p, corresponds to a maximum value among all possible minimum distances of all possible polar codes of size p and dimension h generated on the basis of the kernel Tp. The method also includes generating a distance spectrum vector dGN of size N of the generator matrix GN on the basis of the distance spectrum vector dTp, determining the set of K information bit indices I on the basis of the distance spectrum vector dGN, and generating the polar code cN on the basis of the set of K information bit indices I.

Abstract: Encoding of information bit sequences by use of an encoding device having more than two encoding entities is provided. Decoding of output codewords by a decoding device having more than two decoding entities is further provided. The encoding and the decoding are implemented through transmitting output codewords, generated by the encoding device, to the decoding device via a channel, wherein two or more user devices transmit the respective output codewords concurrently via the channel.

Abstract: Encoder for encoding K information bits into a code word of length N? on the basis of a polar code of length N, wherein N is a power of 2 and greater than or equal to N?. The encoder comprises a memory storing a plurality of bit indices, wherein the plurality of bit indices comprise a set of N frozen bit indices associated with the polar code of length N, a set of N/2 puncturing bit indices and/or a set of N/2 shortening bit indices and a processor configured to retrieve at least a subset of the plurality of bit indices from the memory, to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to the length N? for obtaining the code word of length N?.

Abstract: The embodiments of the invention relate to a base station configured to manage the distribution of a plurality of files to a user equipment located within a service area of a base station, wherein each file of the plurality of files is decomposed into a plurality of file fragments. The base station comprises a selector configured to select, for each micro base station of a plurality of micro base stations located within the service area of the base station, and for each file of the plurality of files, a subset of the plurality of file fragments of the file, and a distributor configured to distribute to each micro base station, for each file, the selected subset of the plurality of file fragments to cache the selected subset of the plurality of file fragments at respective micro base station.