article · IEEE Transactions on Information Theory · 2000
Adding a parity-check bit
Cited by 27Abstract and details only
Abstract
The article gives a new condition for a q-ary linear code of length n and minimum distance d to be extendable to a code of the same dimension, length n+1, and minimum distance >d.
Cite this paper
Simonis, J. (2000). Adding a parity-check bit. IEEE Transactions on Information Theory, 46(4), 1544–1545. https://doi.org/10.1109/18.850691
Simonis, Juriaan. “Adding a parity-check bit.” IEEE Transactions on Information Theory, vol. 46, no. 4, 2000, pp. 1544–45, https://doi.org/10.1109/18.850691.
Simonis, Juriaan. 2000. “Adding a parity-check bit.” IEEE Transactions on Information Theory 46 (4): 1544–45. https://doi.org/10.1109/18.850691.
Simonis, J. (2000) ‘Adding a parity-check bit’, IEEE Transactions on Information Theory, 46(4), pp. 1544–1545. Available at: https://doi.org/10.1109/18.850691.
@article{simonis2000adding,
title = {{Adding a parity-check bit}},
author = {Simonis, Juriaan},
journal = {IEEE Transactions on Information Theory},
volume = {46},
number = {4},
pages = {1544--1545},
year = {2000},
doi = {10.1109/18.850691}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.