Skip to content
HALOWERK

Datenvertragswerk

bijective burrows wheeler transform ledger

From one binary word of 0..8 symbols, constructs its bijective Burrows-Wheeler transform (BBWT, Scott/BWTS). The word is split by Chen-Fox-Lyndon factorization into nonincreasing Lyndon words, every cyclic left rotation of every factor is sorted by infinite periodic omega-order, and the last symbol of each sorted rotation forms encoded. Also returns the factors, aligned rotation_factor_indices and rotation_offsets. No terminal sentinel or primary row index.

POST https://datenvertrag.halowerk.com/v1/bijective-burrows-wheeler-transform-ledger

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
wordSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "word": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": 0,
            "maximum": 1
          },
          "minItems": 0,
          "maxItems": 8
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "integer",
            "minimum": 0,
            "maximum": 1
          },
          "minItems": 0,
          "maxItems": 8
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "word",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "word": [],
  "claim": []
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’