The hexagon theoremIEEE Transactions on Information Theory - Tập 28 Số 2 - Trang 137-139 - 1982
Donald J. Newman
Random codes: minimum distances and error exponentsIEEE Transactions on Information Theory - Tập 48 Số 9 - Trang 2568-2573 - 2002
A. Barg, G.D. Forney
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length N and rate R is shown to have minimum distance N/spl delta//sub GV/(2R), where /spl delta//sub GV/(R) is the Gilbert-Varshamov (GV) relative distan...... hiện toàn bộ
#Linear codes #Channel coding