Alternatives and similar repositories for base32768

Users that are interested in base32768 are comparing it to the libraries listed below

• qntm / base1
  Binary encoding inspired by unary numbers
  ☆74Updated 3 months ago
• qntm / base131072
  Binary-to-text encoding optimised for Twitter & UTF-32
  ☆85Updated 3 months ago
• qntm / braille-encode
  Represent binary data as Braille
  ☆42Updated 3 months ago
• ukyo / zlib-asm
  ☆23Updated 8 years ago
• saschanaz / libflif.js
  Another trial to get FLIF to the web platform
  ☆42Updated 5 years ago
• kevinAlbs / Base122
  A space efficient alternative to base-64
  ☆238Updated last year
• runarberg / mathup
  Easy MathML authoring tool with a quick to write syntax
  ☆85Updated 3 months ago
• qntm / safe-code-point
  Ascertains whether a Unicode code point is 'safe' for the purposes of encoding binary data
  ☆20Updated 3 months ago
• node-unicode / node-unicode-data
  JavaScript-compatible Unicode data generator. Arrays of code points, arrays of symbols, and regular expressions for every Unicode version…
  ☆152Updated last month
• grncdr / js-shell-parse
  parse bash, with javascript (UNMAINTAINED)
  ☆92Updated 6 years ago
• qgustavor / generic-speck
  Generalized version of the Speck cipher for integer obfuscation
  ☆10Updated 9 months ago
• billiegoose / cors-buster
  When you need a file, but the headers ain't good, who you gonna call? CORS Buster!
  ☆52Updated last year
• noniq / meta-noop
  Because a single implementation of noop() won't do.
  ☆14Updated 9 years ago
• fwg / s-expression
  javascript s-expression parser with quote support
  ☆59Updated 4 years ago
• erights / quasiParserGenerator
  A template string tag for generating template string tags.
  ☆66Updated 4 years ago
• foliojs / grapheme-breaker
  A JS implementation of the Unicode grapheme cluster breaking algorithm (UAX #29)
  ☆85Updated 5 years ago
• mathiasbynens / wtf-8
  A well-tested WTF-8 encoder/decoder written in JavaScript.
  ☆39Updated 8 years ago
• tjvr / nearley-reverse
  Opposite of a parser: generates minimum-length derivation from a parse tree.
  ☆17Updated 7 years ago
• louismullie / erc-js
  A Javascript implementation of Reed-Solomon error correcting codes.
  ☆29Updated last month
• foliojs / restructure
  Declaratively encode and decode binary data
  ☆135Updated last year
• tvcutsem / es-lab
  Automatically exported from code.google.com/p/es-lab
  ☆24Updated 6 years ago
• tc39 / proposal-rm-builtin-subclassing
  Remove ES6 built-in subclassing
  ☆41Updated last year
• sl236 / Piet
  Piet assembler and compiler
  ☆51Updated 6 years ago
• pigulla / mersennetwister
  A standalone, pure JavaScript implementation of the Mersenne Twister pseudo random number generator. Compatible with Node.js, requirejs a…
  ☆76Updated 9 years ago
• dead-claudia / proposal-positive-modulo
  A proposal for adding a divisor-dependent modulo operator to ECMAScript
  ☆11Updated 3 years ago
• rhmoller / wasm-by-hand
  Small cookbook examples of writing WebAssembly by hand in .wast format
  ☆55Updated 2 years ago
• pvdz / preval
  A wannabe JS compiler (still very much wip, not production ready)
  ☆16Updated 2 weeks ago
• tc39 / proposal-intl-segmenter
  Unicode text segmentation for ECMAScript
  ☆149Updated 3 years ago
• tschneidereit / proposal-typed-objects
  Proposal for adding Typed Objects to JavaScript
  ☆28Updated 4 years ago
• copy / jslzjb-k
  Fast compression for JavaScript (browser and node)
  ☆29Updated 8 years ago