91   - [FSE](#fse)
423 - Previous FSE decoding tables, required by `Repeat_Mode`
634             The FSE tables used in `Repeat_Mode` aren't updated.
658 - `Predefined_Mode` : A predefined FSE distribution table is used, defined in
663 - `FSE_Compressed_Mode` : standard FSE compression.
665 …The format of this distribution table is described in [FSE Table Description](#fse-table-descripti…
682 _Codes_ are FSE compressed,
766 FSE bitstreams are read in reverse direction than written. In zstd,
784 FSE decoding requires a 'state' to be carried from symbol to symbol.
785 For more explanation on FSE decoding, see the [FSE section](#fse).
789 Some FSE primitives are also used.
790 For more details on the operation of these primitives, see the [FSE section](#fse).
793 The bitstream starts with initial FSE state values,
813 For each of the symbol types, the FSE state can be used to determine the appropriate code.
829 See the [FSE section](#fse) for details on how to update states from the bitstream.
837 its FSE decoding table is generated from a predefined distribution table defined here.
838 For details on how to convert this distribution into a decoding table, see the [FSE section].
840 [FSE section]: #from-normalized-distribution-to-decoding-tables
1004 FSE, and Huffman coding.
1006 while FSE is used for all other symbols
1011 FSE  section in Zstandard Compression Format
1013 FSE, short for Finite State Entropy, is an entropy codec based on [ANS].
1014 FSE encoding/decoding involves a state that is carried over between symbols,
1016 Therefore, all FSE bitstreams are read from end to beginning.
1020 For additional details on FSE, see [Finite State Entropy].
1024 FSE decoding involves a decoding table which has a power of 2 size, and contain three elements:
1027 An FSE state value represents an index in this table.
1036 ### FSE Table Description  argument
1037 To decode FSE streams, it is necessary to construct the decoding table.
1038 The Zstandard format encodes FSE table descriptions as follows:
1040 An FSE distribution table describes the probabilities of all symbols
1185 similar to the FSE bitstreams.
1271   the series of weights is compressed using FSE (see below).
1272   The length of the FSE-compressed series is equal to `headerByte` (0-127).
1291       In such case, it's necessary to use FSE compression.
1294 #### Finite State Entropy (FSE) compression of Huffman weights
1296 In this case, the series of Huffman weights is compressed using FSE compression.
1300 To decode an FSE bitstream, it is necessary to know its compressed size.
1306 An FSE bitstream starts by a header, describing probabilities distribution.
1309 For more description see the [FSE header description](#fse-table-description)
1312 which share the same FSE distribution table.
1317 For more details on these FSE operations, see the [FSE section](#fse).
1437               See the relevant [FSE](#fse-table-description)
1440               Huffman tables for literals, FSE table for offsets,
1441               FSE table for match lengths, and FSE table for literals lengths.
1468 This appendix contains FSE decoding tables
1675 - 0.3.4 : clarifications for FSE decoding table