A Low Complexity Algorithm and Architecture For Systematic Encoding of Hermitian Codes

Typeset version

 

TY  - RPRT
  - Unpublished Reports
  - Agarwal, R, Koetter, R, Popovici, EM
  - 2007
  - July
  - A Low Complexity Algorithm and Architecture For Systematic Encoding of Hermitian Codes
  - Author
  - Validated
  - 0
  - ()
  - We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q(2)), the proposed algorithm achieves a run time complexity of O(q(2)) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space complexity of O(q(2)) in terms of finite field multipliers and memory elements..
  - http://arxiv.org/PS_cache/arxiv/pdf/0704/0704.0590v2.pdf
  - 1336
  - 1340
DA  - 2007/07
ER  - 
@report{V723752,
   = {Unpublished Reports},
   = {Agarwal,  R and  Koetter,  R and  Popovici,  EM },
   = {2007},
   = {July},
   = {A Low Complexity Algorithm and Architecture For Systematic Encoding of Hermitian Codes},
   = {Author},
   = {Validated},
   = {0},
   = {()},
   = {{We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q(2)), the proposed algorithm achieves a run time complexity of O(q(2)) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space complexity of O(q(2)) in terms of finite field multipliers and memory elements..}},
   = {http://arxiv.org/PS_cache/arxiv/pdf/0704/0704.0590v2.pdf},
  pages = {1336--1340},
  source = {IRIS}
}
OTHER_PUB_TYPEUnpublished Reports
AUTHORSAgarwal, R, Koetter, R, Popovici, EM
YEAR2007
MONTHJuly
TITLEA Low Complexity Algorithm and Architecture For Systematic Encoding of Hermitian Codes
RESEARCHER_ROLEAuthor
STATUSValidated
PEER_REVIEW0
TIMES_CITED()
SEARCH_KEYWORD
REFERENCE
ABSTRACTWe present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q(2)), the proposed algorithm achieves a run time complexity of O(q(2)) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space complexity of O(q(2)) in terms of finite field multipliers and memory elements..
PUBLISHER_LOCATION
PUBLISHER
EDITORS
ISBN_ISSN
EDITION
URLhttp://arxiv.org/PS_cache/arxiv/pdf/0704/0704.0590v2.pdf
START_PAGE1336
END_PAGE1340
DOI_LINK
FUNDING_BODY
GRANT_DETAILS