Popularity

6.5

Declining

Activity

0.0

Stable

Stars 20

Watchers 3

Forks 2

Last Commit over 6 years ago

Monthly Downloads: 14

Programming language: Haskell

License: MIT License

Tags: Data

Latest version: v0.0.4.3

reedsolomon alternatives and similar packages

Based on the "Data" category.
Alternatively, view reedsolomon alternatives based on common mentions on social networks and blogs.

lens

10.0 3.8 reedsolomon VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source

10.0 8.0 reedsolomon VS semantic-source

Parsing, analyzing, and comparing source code across many languages

TestGPT | Generating meaningful tests for busy devs

Get non-trivial tests (and trivial, too!) suggested right inside your IDE, so you can code smart, create more value, and stay confident when you push.

Promo codium.ai

hnix

9.9 4.5 reedsolomon VS hnix

A Haskell re-implementation of the Nix expression language
text

9.8 6.1 reedsolomon VS text

Haskell library for space- and time-efficient operations over Unicode text.
code-builder

9.8 0.0 reedsolomon VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
Frames

9.7 0.0 reedsolomon VS Frames

Data frames for tabular data.
unordered-containers

9.7 1.2 reedsolomon VS unordered-containers

Efficient hashing-based container types
massiv

9.7 0.0 reedsolomon VS massiv

Efficient Haskell Arrays featuring Parallel computation
compendium-client

9.7 0.0 reedsolomon VS compendium-client

Mu (μ) is a purely functional framework for building micro services.
cassava

9.7 0.0 reedsolomon VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
hashable

9.6 2.1 reedsolomon VS hashable

A class for types that can be converted to a hash value
holmes

9.6 0.0 reedsolomon VS holmes

A reference library for constraint-solving with propagators and CDCL.
critbit

9.5 0.0 reedsolomon VS critbit

A Haskell implementation of crit-bit trees.
primitive

9.5 3.7 reedsolomon VS primitive

This package provides various primitive memory-related operations.
refined

9.5 0.0 reedsolomon VS refined

Refinement types with static checking
binary

9.5 0.0 reedsolomon VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
alfred-margaret

9.5 6.5 reedsolomon VS alfred-margaret

Fast Aho-Corasick string searching
resource-pool

9.5 0.0 reedsolomon VS resource-pool

A high-performance striped resource pooling implementation for Haskell
caledon

9.4 0.0 reedsolomon VS caledon

higher order dependently typed logic programing
higgledy

9.4 0.0 reedsolomon VS higgledy

Higher-kinded data via generics
aeson-qq

9.4 0.0 reedsolomon VS aeson-qq

JSON quasiquoter for Haskell
network-msgpack-rpc

9.4 reedsolomon VS network-msgpack-rpc

A MessagePack-RPC Implementation
diskhash

9.4 0.0 reedsolomon VS diskhash

Diskbased (persistent) hashtable
hashtables

9.4 0.0 reedsolomon VS hashtables

Mutable hash tables for Haskell, in the ST monad
data-msgpack

9.4 reedsolomon VS data-msgpack

A Haskell implementation of MessagePack
jump

9.4 0.0 reedsolomon VS jump

Jump start your Haskell development
discrimination

9.4 2.6 reedsolomon VS discrimination

Fast linear time sorting and discrimination for a large class of data types
json-autotype

9.4 0.0 reedsolomon VS json-autotype

Automatic Haskell type inference from JSON input
certificate

9.3 0.0 reedsolomon VS certificate

Certificate and Key Reader/Writer in haskell
audiovisual

9.3 0.0 reedsolomon VS audiovisual

Extensible records, variants, structs, effects, tangles
dependent-sum

9.3 0.0 reedsolomon VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
IORefCAS

9.3 0.0 reedsolomon VS IORefCAS

A collection of different packages for CAS based data structures.
cereal

9.3 3.7 reedsolomon VS cereal

A binary serialization library
dependent-map

9.3 0.0 reedsolomon VS dependent-map

Dependently-typed finite maps (partial dependent products)
reflection

9.3 1.2 reedsolomon VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
orgmode-parse

9.2 0.0 reedsolomon VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
streaming

9.2 0.0 reedsolomon VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
stdio

9.2 1.1 reedsolomon VS stdio

Haskell Standard Input and Output
rei

9.2 0.0 reedsolomon VS rei

Process lists easily
protobuf

9.2 1.6 reedsolomon VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
safecopy

9.2 0.0 reedsolomon VS safecopy

An extension to Data.Serialize with built-in version control
bifunctors

9.2 0.0 reedsolomon VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
avro

9.2 0.0 reedsolomon VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
text-icu

9.2 0.0 reedsolomon VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
b-tree

9.1 0.9 reedsolomon VS b-tree

Haskell on-disk B* tree implementation
witherable

9.1 3.1 reedsolomon VS witherable

Filter with effects
tables

9.1 0.0 reedsolomon VS tables

Deprecated because of
uuid

9.1 0.0 reedsolomon VS uuid

A Haskell library for creating, printing and parsing UUIDs
scientific

9.1 0.0 reedsolomon VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
uuid-types

9.1 0.0 reedsolomon VS uuid-types

A Haskell library for creating, printing and parsing UUIDs

Do you think we are missing an alternative of reedsolomon or a related project?

Add another 'Data' Package

Popular Comparisons

README

Reed-Solomon

Reed-Solomon Erasure Coding in Haskell, with speeds exceeding multiple GB/s/cpu core implemented in pure Haskell (and some SIMD C/assembler).

This is a Haskell port of the GolangReedSolomon library released by Klaus Post, wich is a port of the JavaReedSolomon library released by Backblaze, with some additional optimizations.

For an introduction on erasure coding, see the post on the Backblaze blog.

Package home: https://github.com/NicolasT/reedsolomon

Performance

Performance depends mainly on the number of parity shards. In rough terms, doubling the number of parity shards will double the encoding time.

Here are the throughput numbers with some different selections of data and parity shards. For reference each shard is 1MB random data, and 1 CPU core is used for encoding.

Data Parity Parity SSSE3 MB/s AVX2 MB/s 5240%3641,663987,24 10220%3951,014444,44 10440%1821,161927,90 502040%398,09431,78

Example of performance on Intel(R) Core(TM) i7-4600U CPU @ 3.30GHz - 2 physical cores, 4 logical cores (note: /proc/cpuinfo mentions 2.10GHz only). The example uses 10 blocks with 16MB data each and 4 parity blocks.

Threads SSSE3 MB/s AVX2 MB/s Speed 11551,891588,88100%