head 1.2; access; symbols pkgsrc-2023Q4:1.2.0.118 pkgsrc-2023Q4-base:1.2 pkgsrc-2023Q3:1.2.0.116 pkgsrc-2023Q3-base:1.2 pkgsrc-2023Q2:1.2.0.114 pkgsrc-2023Q2-base:1.2 pkgsrc-2023Q1:1.2.0.112 pkgsrc-2023Q1-base:1.2 pkgsrc-2022Q4:1.2.0.110 pkgsrc-2022Q4-base:1.2 pkgsrc-2022Q3:1.2.0.108 pkgsrc-2022Q3-base:1.2 pkgsrc-2022Q2:1.2.0.106 pkgsrc-2022Q2-base:1.2 pkgsrc-2022Q1:1.2.0.104 pkgsrc-2022Q1-base:1.2 pkgsrc-2021Q4:1.2.0.102 pkgsrc-2021Q4-base:1.2 pkgsrc-2021Q3:1.2.0.100 pkgsrc-2021Q3-base:1.2 pkgsrc-2021Q2:1.2.0.98 pkgsrc-2021Q2-base:1.2 pkgsrc-2021Q1:1.2.0.96 pkgsrc-2021Q1-base:1.2 pkgsrc-2020Q4:1.2.0.94 pkgsrc-2020Q4-base:1.2 pkgsrc-2020Q3:1.2.0.92 pkgsrc-2020Q3-base:1.2 pkgsrc-2020Q2:1.2.0.88 pkgsrc-2020Q2-base:1.2 pkgsrc-2020Q1:1.2.0.68 pkgsrc-2020Q1-base:1.2 pkgsrc-2019Q4:1.2.0.90 pkgsrc-2019Q4-base:1.2 pkgsrc-2019Q3:1.2.0.86 pkgsrc-2019Q3-base:1.2 pkgsrc-2019Q2:1.2.0.84 pkgsrc-2019Q2-base:1.2 pkgsrc-2019Q1:1.2.0.82 pkgsrc-2019Q1-base:1.2 pkgsrc-2018Q4:1.2.0.80 pkgsrc-2018Q4-base:1.2 pkgsrc-2018Q3:1.2.0.78 pkgsrc-2018Q3-base:1.2 pkgsrc-2018Q2:1.2.0.76 pkgsrc-2018Q2-base:1.2 pkgsrc-2018Q1:1.2.0.74 pkgsrc-2018Q1-base:1.2 pkgsrc-2017Q4:1.2.0.72 pkgsrc-2017Q4-base:1.2 pkgsrc-2017Q3:1.2.0.70 pkgsrc-2017Q3-base:1.2 pkgsrc-2017Q2:1.2.0.66 pkgsrc-2017Q2-base:1.2 pkgsrc-2017Q1:1.2.0.64 pkgsrc-2017Q1-base:1.2 pkgsrc-2016Q4:1.2.0.62 pkgsrc-2016Q4-base:1.2 pkgsrc-2016Q3:1.2.0.60 pkgsrc-2016Q3-base:1.2 pkgsrc-2016Q2:1.2.0.58 pkgsrc-2016Q2-base:1.2 pkgsrc-2016Q1:1.2.0.56 pkgsrc-2016Q1-base:1.2 pkgsrc-2015Q4:1.2.0.54 pkgsrc-2015Q4-base:1.2 pkgsrc-2015Q3:1.2.0.52 pkgsrc-2015Q3-base:1.2 pkgsrc-2015Q2:1.2.0.50 pkgsrc-2015Q2-base:1.2 pkgsrc-2015Q1:1.2.0.48 pkgsrc-2015Q1-base:1.2 pkgsrc-2014Q4:1.2.0.46 pkgsrc-2014Q4-base:1.2 pkgsrc-2014Q3:1.2.0.44 pkgsrc-2014Q3-base:1.2 pkgsrc-2014Q2:1.2.0.42 pkgsrc-2014Q2-base:1.2 pkgsrc-2014Q1:1.2.0.40 pkgsrc-2014Q1-base:1.2 pkgsrc-2013Q4:1.2.0.38 pkgsrc-2013Q4-base:1.2 pkgsrc-2013Q3:1.2.0.36 pkgsrc-2013Q3-base:1.2 pkgsrc-2013Q2:1.2.0.34 pkgsrc-2013Q2-base:1.2 pkgsrc-2013Q1:1.2.0.32 pkgsrc-2013Q1-base:1.2 pkgsrc-2012Q4:1.2.0.30 pkgsrc-2012Q4-base:1.2 pkgsrc-2012Q3:1.2.0.28 pkgsrc-2012Q3-base:1.2 pkgsrc-2012Q2:1.2.0.26 pkgsrc-2012Q2-base:1.2 pkgsrc-2012Q1:1.2.0.24 pkgsrc-2012Q1-base:1.2 pkgsrc-2011Q4:1.2.0.22 pkgsrc-2011Q4-base:1.2 pkgsrc-2011Q3:1.2.0.20 pkgsrc-2011Q3-base:1.2 pkgsrc-2011Q2:1.2.0.18 pkgsrc-2011Q2-base:1.2 pkgsrc-2011Q1:1.2.0.16 pkgsrc-2011Q1-base:1.2 pkgsrc-2010Q4:1.2.0.14 pkgsrc-2010Q4-base:1.2 pkgsrc-2010Q3:1.2.0.12 pkgsrc-2010Q3-base:1.2 pkgsrc-2010Q2:1.2.0.10 pkgsrc-2010Q2-base:1.2 pkgsrc-2010Q1:1.2.0.8 pkgsrc-2010Q1-base:1.2 pkgsrc-2009Q4:1.2.0.6 pkgsrc-2009Q4-base:1.2 pkgsrc-2009Q3:1.2.0.4 pkgsrc-2009Q3-base:1.2 pkgsrc-2009Q2:1.2.0.2 pkgsrc-2009Q2-base:1.2 pkgsrc-2009Q1:1.1.1.1.0.20 pkgsrc-2009Q1-base:1.1.1.1 pkgsrc-2008Q4:1.1.1.1.0.18 pkgsrc-2008Q4-base:1.1.1.1 pkgsrc-2008Q3:1.1.1.1.0.16 pkgsrc-2008Q3-base:1.1.1.1 cube-native-xorg:1.1.1.1.0.14 cube-native-xorg-base:1.1.1.1 pkgsrc-2008Q2:1.1.1.1.0.12 pkgsrc-2008Q2-base:1.1.1.1 cwrapper:1.1.1.1.0.10 pkgsrc-2008Q1:1.1.1.1.0.8 pkgsrc-2008Q1-base:1.1.1.1 pkgsrc-2007Q4:1.1.1.1.0.6 pkgsrc-2007Q4-base:1.1.1.1 pkgsrc-2007Q3:1.1.1.1.0.4 pkgsrc-2007Q3-base:1.1.1.1 pkgsrc-2007Q2:1.1.1.1.0.2 pkgsrc-2007Q2-base:1.1.1.1 pkgsrc-base:1.1.1.1 TNF:1.1.1; locks; strict; comment @# @; 1.2 date 2009.06.14.17.49.07; author joerg; state Exp; branches; next 1.1; 1.1 date 2007.04.15.21.39.52; author agc; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2007.04.15.21.39.52; author agc; state Exp; branches; next ; desc @@ 1.2 log @Remove @@dirrm entries from PLISTs @ text @@@comment $NetBSD: PLIST,v 1.1.1.1 2007/04/15 21:39:52 agc Exp $ bin/rscode lib/libecc.a share/doc/rscode/rs.doc @ 1.1 log @Initial revision @ text @d1 1 a1 1 @@comment $NetBSD$ a4 1 @@dirrm share/doc/rscode @ 1.1.1.1 log @Initial import of rscode-1.0 into the Packages Collection. The Reed-Solomon Code is an algebraic code belonging to the class of BCH (Bose-Chaudry-Hocquehen) multiple burst correcting cyclic codes. The Reed Solomon code operates on bytes of fixed length. Given m parity bytes, a Reed-Solomon code can correct up to m byte errors in known positions (erasures), or detect and correct up to m/2 byte errors in unknown positions. This is an implementation of a Reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (codeword) that can be generated is 255 bytes, including parity bytes. In practice, shorter sequences are used. The more general error-location algorithm is the Berlekamp-Massey algorithm, which will locate up to four errors, by iteratively solving for the error-locator polynomial. The Modified Berlekamp Massey algorithm takes as initial conditions any known suspicious bytes (erasure flags) which you may have (such as might be flagged by a laser demodulator, or deduced from a failure in a cross-interleaved block code row or column). Once the location of errors is known, error correction is done using the error-evaluator polynomial. @ text @@