[PDF][PDF] On parameter optimization for staircase codes.
OFC, 2015•chaeger.github.io
• Start with a binary linear code C (n, k, dmin) as a “building block”• C: BCH code defined by
(ν, t, s), where• ν: Galois-field extension degree• t: error-correction capability• s: shortening
parameter•⇒ length n= 2ν− 1− s, dimension k= 2ν− νt− 1− s• Staircase code rate R= 2k/n− 1
and FEC overhead OH= 1/R− 1
(ν, t, s), where• ν: Galois-field extension degree• t: error-correction capability• s: shortening
parameter•⇒ length n= 2ν− 1− s, dimension k= 2ν− νt− 1− s• Staircase code rate R= 2k/n− 1
and FEC overhead OH= 1/R− 1
• Start with a binary linear code C (n, k, dmin) as a “building block”• C: BCH code defined by (ν, t, s), where• ν: Galois-field extension degree• t: error-correction capability• s: shortening parameter•⇒ length n= 2ν− 1− s, dimension k= 2ν− νt− 1− s• Staircase code rate R= 2k/n− 1 and FEC overhead OH= 1/R− 1
chaeger.github.io
Showing the best result for this search. See all results