Test vectors are given as a part of the simulations on Gaussian noise channel. For all zero codeword transmission, a received noisy vector with length 128, the most probable L=49 messages with length 64 bit (in 16 hexadecimal), Euclidean distances and also the 64 bit indices in a 128 bit vector are provided.

DOI Link: 
10.21227/t1qs-n650
Read more

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Subscribe now or login.

Documentation: 
AttachmentSize
File test_data (1).pdf27.46 KB
[1] Sinan Kahraman, "Test vectors of the list-decoding for most probable messages of polar codes", IEEE Dataport, 2024. [Online]. Available: http://dx.doi.org/10.21227/t1qs-n650. Accessed: Dec. 06, 2024.
@data{t1qs-n650-24,
doi = {10.21227/t1qs-n650},
url = {http://dx.doi.org/10.21227/t1qs-n650},
author = {Sinan Kahraman },
publisher = {IEEE Dataport},
title = {Test vectors of the list-decoding for most probable messages of polar codes},
year = {2024} }
TY - DATA
T1 - Test vectors of the list-decoding for most probable messages of polar codes
AU - Sinan Kahraman
PY - 2024
PB - IEEE Dataport
UR - 10.21227/t1qs-n650
ER -
Sinan Kahraman. (2024). Test vectors of the list-decoding for most probable messages of polar codes. IEEE Dataport. http://dx.doi.org/10.21227/t1qs-n650
Sinan Kahraman, 2024. Test vectors of the list-decoding for most probable messages of polar codes. Available at: http://dx.doi.org/10.21227/t1qs-n650.
Sinan Kahraman. (2024). "Test vectors of the list-decoding for most probable messages of polar codes." Web.
1. Sinan Kahraman. Test vectors of the list-decoding for most probable messages of polar codes [Internet]. IEEE Dataport; 2024. Available from : http://dx.doi.org/10.21227/t1qs-n650
Sinan Kahraman. "Test vectors of the list-decoding for most probable messages of polar codes." doi: 10.21227/t1qs-n650