fq_bit_unpack
Synopsis
#include <flint/fq.h>void fq_bit_unpack(fq_t rop, const fmpz_t f, flint_bitcnt_t bit_size, const fq_ctx_t ctx)sourceSets rop to the class of the polynomial whose coefficients are the consecutive bit_size-bit fields of the nonnegative integer f, reducing the coefficients modulo p and the polynomial modulo f. This is the inverse of fq_bit_pack and recovers a product from the packed product of two packed operands if the fields are wide enough.
Cite this page
The FLINT team, “fq_bit_unpack (fq.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq/fq_bit_unpack.html (generated 2026-10-20).
@misc{flint-doc-fq-fq-bit-unpack,
author = {{The FLINT team}},
title = {{fq\_bit\_unpack (fq.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq/fq_bit_unpack.html},
note = {Generated 2026-10-20}
}