You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Add trait "iscomplete" to every alphabet. It should default to Val{false}(). It should return Val{true} if length(symbols(A)) == 1 << bits_per_symbol(A), i.e. if all bitpatterns are valid. In that case, the decoder can skip validation. There are also other efficiencies to be had, such as better random sequence generation.
The text was updated successfully, but these errors were encountered:
Okay, this is now added in #161 . Turns out it was not that important, actually. With a little tweaking of the index functions to remove all unnecessary branches and signed/unsigned conversions, here is what f(x, i) = @inbounds x[i] compiles to:
Add trait "iscomplete" to every alphabet. It should default to
Val{false}()
. It should returnVal{true}
iflength(symbols(A)) == 1 << bits_per_symbol(A)
, i.e. if all bitpatterns are valid. In that case, the decoder can skip validation. There are also other efficiencies to be had, such as better random sequence generation.The text was updated successfully, but these errors were encountered: