An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k*,d) augmented code C
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tadashi WADAYAMA, Hiroyuki KADOKAWA, "An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 10, pp. 2196-2202, October 2002, doi: .
Abstract: An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k*,d) augmented code C
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_10_2196/_p
Copy
@ARTICLE{e85-a_10_2196,
author={Tadashi WADAYAMA, Hiroyuki KADOKAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm},
year={2002},
volume={E85-A},
number={10},
pages={2196-2202},
abstract={An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k*,d) augmented code C
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2196
EP - 2202
AU - Tadashi WADAYAMA
AU - Hiroyuki KADOKAWA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2002
AB - An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k*,d) augmented code C
ER -