Zint is a suite of programs to allow easy encoding of data in any of the wide range of public domain barcode standards and to allow integration of this capability into your own programs.

qrcodegen-cpp is a QR code generator library in C++. The project also offers Java, Javascript, Python, C, and Rust implementations.

Read one-dimensional barcodes and QR codes using the zbar library.

Features:

• Pure python

• Works with PIL / Pillow images, OpenCV / numpy ndarrays, and raw bytes

• Decodes locations of barcodes

• No dependencies, other than the zbar library itself

ZBar can read barcodes from various sources, such as video streams, image files, and raw intensity sensors. It supports EAN-13/UPC-A, UPC-E, EAN-8, Code 128, Code 93, Code 39, Codabar, Interleaved 2 of 5, QR Code and SQ Code. Included with the library are basic applications for decoding captured bar code images and using a video device (e.g. webcam) as a bar code scanner. For application developers, language bindings are included for C, C++ and Python as well as GUI widgets for GTK and Qt.

libdmtx is software for reading and writing Data Matrix 2D barcodes of the modern ECC200 variety. libdmtx is a shared library, allowing C/C++ programs to use its capabilities without restrictions or overhead.

Package qr encodes QR codes.

Zint is a suite of programs to allow easy encoding of data in any of the wide range of public domain barcode standards and to allow integration of this capability into your own programs.

Golang library for generating QR codes in the terminal. Originally this was a port of the NodeJS version. Recently it's been updated to allow for smaller code generation using ASCII 'half blocks'.

Libqrencode is a C library for encoding data in a QR Code symbol, a kind of 2D symbology that can be scanned by handy terminals such as a mobile phone with CCD. The capacity of QR Code is up to 7000 digits or 4000 characters, and is highly robust.

ZXing-CPP is a barcode scanning library.

libdmtx is a software library that enables programs to read and write Data Matrix barcodes of the modern ECC200 variety. This package, dmtx-utils, provides command line utilities that allow scripts and command line users to use libdmtx functionality.

This package includes the following programs:

1. dmtxquery: Extract information from dmtxread output.

2. dmtxread: Scan Data Matrix barcodes.

3. dmtxwrite: Create Data Matrix barcodes.

Symmetrica is a library for combinatorics. It has support for the representation theory of the symmetric group and related groups, combinatorics of tableaux, symmetric functions and polynomials, Schubert polynomials, and the representation theory of Hecke algebras of type A_n.

JLargeArrays is a Java library of one-dimensional arrays that can store up to 263 elements.

NTL is a C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields.

PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorisations, algebraic number theory, elliptic curves...), but it also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers, etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations.

libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids.

FFLAS-FFPACK is a C++ template library for basic linear algebra operations over a finite field. FFLAS (Finite Field Linear Algebra Subprograms) provides the implementation of a subset of routines of the numerical BLAS; it also supports sparse matrix-vector products. FFPACK (Finite Field Linear Algebra Package) is inspired by the LAPACK library to provide functionalities of higher level, using the kernel of a BLAS. Additionally, it provides routines specific to exact linear algebra, such as the row echelon form.

GMP-ECM factors integers using the elliptic curve method (ECM) as well as the P-1 and P+1 algorithms. It provides a library and a stand-alone binary.

M4RI is a library for fast arithmetic with dense matrices over F2. The name M4RI comes from the first implemented algorithm: The Method of the Four Russians inversion algorithm published by Gregory Bard. This algorithm in turn is named after the Method of the Four Russians multiplication algorithm.

FLINT is a C library for number theory. It supports arithmetic with numbers, polynomials, power series and matrices over many base rings, including multiprecision integers and rationals, integers modulo n, p-adic numbers, finite fields (prime and non-prime order) and real and complex numbers (via the Arb extension library).

Operations that can be performed include conversions, arithmetic, GCDs, factoring, solving linear systems, and evaluating special functions. In addition, FLINT provides various low-level routines for fast arithmetic.

REDUCE is a portable general-purpose computer algebra system. It is a system for doing scalar, vector and matrix algebra by computer, which also supports arbitrary precision numerical approximation and interfaces to gnuplot to provide graphics. It can be used interactively for simple calculations but also provides a full programming language, with a syntax similar to other modern programming languages. REDUCE supports alternative user interfaces including Run-REDUCE, TeXmacs and GNU Emacs. This package provides the Codemist Standard Lisp (CSL) version of REDUCE. It uses the gnuplot program, if installed, to draw figures.

Gappa is a tool intended to help verifying and formally proving properties on numerical programs dealing with floating-point or fixed-point arithmetic. It has been used to write robust floating-point filters for CGAL and it is used to certify elementary functions in CRlibm. While Gappa is intended to be used directly, it can also act as a backend prover for the Why3 software verification platform or as an automatic tactic for the Coq proof assistant.

fplll contains implementations of several lattice algorithms. The implementation relies on floating-point orthogonalization, and LLL is central to the code, hence the name.

It includes implementations of floating-point LLL reduction algorithms, offering different speed/guarantees ratios. It contains a wrapper choosing the estimated best sequence of variants in order to provide a guaranteed output as fast as possible. In the case of the wrapper, the succession of variants is oblivious to the user.

It includes an implementation of the BKZ reduction algorithm, including the BKZ-2.0 improvements (extreme enumeration pruning, pre-processing of blocks, early termination). Additionally, Slide reduction and self dual BKZ are supported.

It also includes a floating-point implementation of the Kannan-Fincke-Pohst algorithm that finds a shortest non-zero lattice vector. For the same task, the GaussSieve algorithm is also available in fplll. Finally, it contains a variant of the enumeration algorithm that computes a lattice vector closest to a given vector belonging to the real span of the lattice.

PyNormaliz provides an interface to Normaliz via libNormaliz. It offers the complete functionality of Normaliz, and can be used interactively from Python.