关于「GF(2^8) 上的里德–所罗门:纯标准库编码与擦除恢复」,《书库冲突检测、可复现与纠删码》给出的定量结论是什么?

结论:第五章在 GF(2^8) 上用纯标准库实现系统形式的里德–所罗门擦除码,开销 1.50 倍即可容忍三块丢失,RS(10+4) 的 1,001 种存活组合全部可解。

数据口径:书中的书库规模、错误率、风险率与故障率均为示意参数;全部计算由书中程序生成;本书不是法律、财务、采购或存储服务建议。 第一章把书库画成知识图谱,说明卷数越多错误越难藏身:示意书库到 200 卷时,0.9821 的偏差定义处在可以被另一卷反驳的位置。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 10, 1001

lostpatternsreplication 3x3RS(6+3)decoded
010.00000.00001
190.00000.00009
2360.00000.000036
3840.03570.000084
41260.14291.00000
51260.35711.00000
6840.67861.00000
RS(10+4): 1,001 of 1,001 survivor sets decodable
查看完整验算程序
# Chapter 5. p52: every loss pattern, enumerated. Nine disks hold either
# three blocks in three copies each (replication, overhead 3.0) or one
# RS(6 + 3) stripe of six blocks (overhead 1.5). For each number L of lost
# disks, the share of the C(9, L) patterns that lose data. Every RS
# pattern with L <= 3 is actually decoded and compared with the data; for
# RS(10 + 4) all C(14, 4) = 1,001 choices of 10 survivors are checked for
# an invertible decoding matrix. Data bytes come from a fixed seed.
import itertools
import math
import random

EXP, LOG = [0] * 512, [0] * 256
v = 1
for i in range(255):
    EXP[i], LOG[v] = v, i
    v <<= 1
    if v & 0x100:
        v ^= 0x11D
for i in range(255, 512):
    EXP[i] = EXP[i - 255]


def mul(a, b):
    return 0 if a == 0 or b == 0 else EXP[LOG[a] + LOG[b]]


def inv(a):
    return EXP[255 - LOG[a]]


def gen(k, m):
    g = [[1 if r == c else 0 for c in range(k)] for r in range(k)]
    return g + [[inv((k + i) ^ j) for j in range(k)] for i in range(m)]


def solve(a, b):
    n = len(a)
    a = [row[:] + [x] for row, x in zip(a, b)]
    for c in range(n):
        p = next((r for r in range(c, n) if a[r][c]), None)
        if p is None:
            return None
        a[c], a[p] = a[p], a[c]
        s = inv(a[c][c])
        a[c] = [mul(s, x) for x in a[c]]
        for r in range(n):
            if r != c and a[r][c]:
                f = a[r][c]
                a[r] = [x ^ mul(f, y) for x, y in zip(a[r], a[c])]
    return [row[n] for row in a]


rng = random.Random(20261112)
G = gen(6, 3)
data = [rng.randrange(256) for _ in range(6)]
code = []
for row in G:
    acc = 0
    for c, d in zip(row, data):
        acc ^= mul(c, d)
    code.append(acc)

print("{:>4} {:>9} {:>16} {:>16} {:>9}".format(
    "lost", "patterns", "replication 3x3", "RS(6+3)", "decoded"))
for L in range(7):
    pats = list(itertools.combinations(range(9), L))
    rep = rs = ok = 0
    for gone in pats:
        if any(all(3 * b + c in gone for c in range(3)) for b in range(3)):
            rep += 1
        alive = [i for i in range(9) if i not in gone]
        if len(alive) < 6:
            rs += 1
            continue
        use = alive[:6]
        got = solve([G[i] for i in use], [code[i] for i in use])
        if got == data:
            ok += 1
        else:
            rs += 1
    print("{:>4} {:>9} {:>16.4f} {:>16.4f} {:>9}".format(
        L, len(pats), rep / len(pats), rs / len(pats), ok))

G2 = gen(10, 4)
good = 0
for alive in itertools.combinations(range(14), 10):
    if solve([G2[i] for i in alive], [0] * 10) is not None:
        good += 1
print("RS(10+4): {:,} of {:,} survivor sets decodable".format(
    good, math.comb(14, 10)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超大规模双语专著库跨卷定理冲突检测、代码可复现性衰减防腐与冷存储纠删码》第 5 章「GF(2^8) 上的里德–所罗门:纯标准库编码与擦除恢复」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-182 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026182,
  author    = {Fan, Yafu},
  title     = {Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论