The textbook categorical data analysis treatment, say Agresti (2002), of a $N\times D$ contingency table $C$ with components $C_{ij}$ involves three log linear model
\begin{align*}
\log E[C_{ij}] =& \lambda & \text{(constant rate)}\\
\log E[C_{ij}] =& \lambda + \lambda^R_i + \lambda^C_j & \text{(independence)}\\
\log E[C_{ij}] =& \lambda + \lambda^R_i + \lambda^C_j + \lambda^{RC}_{ij} & \text{(saturated)}
\end{align*}
where $\lambda$ is scalar, $\lambda^R$ is length $N$, $\lambda^C$ is length $D$, and $\lambda^{RC}$ is an $N\times D$ matrix of of interaction terms. Typical identification constraints include that $\lambda^R$ and $\lambda^C$ have mean 0.
Log bilinear models have complexity between the independence and saturated models (but require a different fitting process due to the multiplicative term). The simplest log bilinear model would be
\begin{align*}
\log E[C_{ij}] & = \lambda + \lambda^R_i + \lambda^C_j + \mu_i \nu_j & \text{(RC model* / log-bilinear)}
\end{align*}
where $\mu$ is length $N$, $\nu$ is length $D$. (*Goodman's original formulation absorbs $\lambda$ into another parameter). Extra identification
constraints are required here, e.g. Z-scored $\mu$ and mean zero $\nu$.
The standard treatment of these is from Goodman (1979), who called this the RC association model, but as far as I can see this is the generic log bilinear structure.
Increasing the number of multiplicative terms to, say M, moves the flexibility of the model towards the saturated model, and are referred to as RC(M) models, although only the RC model seems to called log bilinear.